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 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
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}
}