Abstract
A strong edge-coloring of a graph G is a function that assigns to each edge a color such that two edges within distance two apart must receive different colors. The minimum number of colors used in a strong edge-coloring is the strong chromatic index of G. Lih and Liu (2011) [14] proved that the strong chromatic index of a cubic Halin graph, other than two special graphs, is 6 or 7. It remains an open problem to determine which of such graphs have strong chromatic index 6. Our article is devoted to this open problem. In particular, we disprove a conjecture of Shiu et al. (2006) [18] that the strong chromatic index of a cubic Halin graph with characteristic tree a caterpillar of odd leaves is 6.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
