Best-bound conjecture for the star chromatic index of outerplanar graphs
Best-bound conjecture for the star chromatic index of outerplanar graphs
Let be an outerplanar graph with maximum degree . The outerplanar star chromatic index conjecture.
This would improve the known bound for outerplanar graphs and is presented as the conjectured best upper bound for the star chromatic index. Its resolution is not specified in the supplied text.
Sources & referencesView supporting material
Primary source
Xuling Hou, Lingxi Li and Tao Wang, “Star edge-coloring of some special graphs”, arXiv:2010.14349 (2020).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.