A note on a conjecture of star chromatic index for outerplanar graphs
Xingchao Deng, Qingye Yao, Yanbing Zhang, Xudong Cui

TL;DR
This paper investigates the star chromatic index of outerplanar graphs, providing new upper bounds for 2-connected graphs with small diameter or maximum degree, advancing understanding of coloring properties in such graphs.
Contribution
It establishes improved upper bounds for the star chromatic index of 2-connected outerplanar graphs with specific diameter and degree constraints.
Findings
For 2-connected outerplanar graphs with diameter 2 or 3, star chromatic index ≤ Δ+6.
For 2-connected outerplanar graphs with maximum degree 5, star chromatic index ≤ 9.
Supports conjecture relating star chromatic index to maximum degree in outerplanar graphs.
Abstract
A star edge coloring of a graph is a proper edge coloring of without bichromatic paths or cycles of length four. The it star chromatic index, of is the minimum number for which has a star edge coloring by colors. In \cite{LB}, L. Bezegov et al. conjectured that when is an outerplanar graph with maximum degree In this paper we obtained that when is an 2-connected outerplanar graph with diameter 2 or 3. If is an 2-connected outerplanar graph with maximum degree 5, then
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Graph theory and applications
