English

A note on a conjecture of star chromatic index for outerplanar graphs

Combinatorics 2020-06-02 v1

Abstract

A star edge coloring of a graph GG is a proper edge coloring of GG without bichromatic paths or cycles of length four. The it star chromatic index, χst(G),\chi_{st}^{'} (G ), of GG is the minimum number kk for which GG has a star edge coloring by kk colors. In \cite{LB}, L. Bezegovaˊ\acute{a} et al. conjectured that χst(G)3Δ2+1\chi_{st}^{'} (G )\leq \lfloor\frac{3\Delta}{2}\rfloor+1 when GG is an outerplanar graph with maximum degree Δ3.\Delta \geq 3. In this paper we obtained that χst(G)Δ+6\chi_{st}^{'}(G) \leq \Delta+6 when GG is an 2-connected outerplanar graph with diameter 2 or 3. If GG is an 2-connected outerplanar graph with maximum degree 5, then χst(G)9.\chi_{st}^{'}(G) \leq 9.

Keywords

Cite

@article{arxiv.2006.00675,
  title  = {A note on a conjecture of star chromatic index for outerplanar graphs},
  author = {Xingchao Deng and Qingye Yao and Yanbing Zhang and Xudong Cui},
  journal= {arXiv preprint arXiv:2006.00675},
  year   = {2020}
}
R2 v1 2026-06-23T15:56:59.104Z