Abstract
AbstractFor a nondecreasing sequence of positive integers, an ‐packing edge‐coloring of a graph is a decomposition of edges of into disjoint sets such that for each the distance between any two distinct edges is at least . The notion of ‐packing edge‐coloring was first generalized by Gastineau and Togni from its vertex counterpart. They showed that there are subcubic graphs that are not ‐packing (abbreviated to ‐packing) edge‐colorable and asked the question whether every subcubic graph is ‐packing edge‐colorable. Very recently, Hocquard, Lajou, and Lužar showed that every subcubic graph is ‐packing edge‐colorable and every 3‐edge‐colorable subcubic graph is ‐packing edge‐colorable. Furthermore, they also conjectured that every subcubic graph is ‐packing edge‐colorable.In this paper, we confirm the conjecture of Hocquard, Lajou, and Lužar, and extend it to multigraphs.
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.
