Star edge coloring of Cactus graphs
Behnaz Omoomi, Marzieh Vahid Dastjerdi, and Yasaman Yektaeian

TL;DR
This paper proves a conjecture about the star chromatic index of Cactus graphs, a subclass of outerplanar graphs, showing it is bounded by a function of maximum degree.
Contribution
It confirms the conjecture for Cactus graphs, extending the understanding of star edge coloring in specific graph classes.
Findings
Star chromatic index of Cactus graphs is at most (3+1)
The conjecture holds for Cactus graphs, a subclass of outerplanar graphs
Provides bounds for star edge coloring in Cactus graphs
Abstract
A star edge coloring of a graph is a proper edge coloring of such that no path or cycle of length four is bi-colored. The star chromatic index of , denoted by , is the minimum such that admits a star edge coloring with colors. Bezegov{\'a} et al. (Star edge coloring of some classes of graphs, J. Graph Theory, 81(1), pp.73-82. 2016) conjectured that the star chromatic index of outerplanar graphs with maximum degree , is at most . In this paper, we prove this conjecture for a class of outerplanar graphs, namely Cactus graphs, wherein every edge belongs to at most one cycle.
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.
