Abstract
The star chromatic index of a mulitigraph G, denoted χs′(G), is the minimum number of colors needed to properly color the edges of G such that no path or cycle of length four is bi-colored. A multigraph G is stark-edge-colorable if χs′(G)≤k. Dvořák et al. (2013) proved that every subcubic multigraph is star 7-edge-colorable, and conjectured that every subcubic multigraph should be star 6-edge-colorable. Kerdjoudj, Kostochka and Raspaud considered the list version of this problem for simple graphs and proved that every subcubic graph with maximum average degree less than 7∕3 is star list-5-edge-colorable. It is known that a graph with maximum average degree 14∕5 is not necessarily star 5-edge-colorable. In this paper, we prove that every subcubic multigraph with maximum average degree less than 12∕5 is star 5-edge-colorable.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
