Abstract
AbstractWe extend the edge‐coloring notion of core (subgraph induced by the vertices of maximum degree) to ‐core (subgraph induced by the vertices with ), and find a sufficient condition for ‐edge‐coloring. In particular, we show that for any , if the ‐core of has multiplicity at most , with its edges of multiplicity inducing a multiforest, then . This extends previous work of Ore, Fournier, and Berge and Fournier. A stronger version of our result (which replaces the multiforest condition with a vertex‐ordering condition) generalizes a theorem of Hoffman and Rodger about cores of ‐edge‐colorable simple graphs. In fact, our bounds hold not only for chromatic index, but for the fan number of a graph, a parameter introduced by Scheide and Stiebitz as an upper bound on chromatic index. We are able to give an exact characterization of the graphs such that whenever has as its ‐core.
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.
