Injective edge-coloring of claw-free subcubic graphs

Qing Cui () and Zhenmeng Han ()
Additional contact information
Qing Cui: Nanjing University of Aeronautics and Astronautics
Zhenmeng Han: Nanjing University of Aeronautics and Astronautics

Journal of Combinatorial Optimization, 2024, vol. 47, issue 5, No 17, 32 pages

Abstract: Abstract An injective edge-coloring of a graph G is an edge-coloring of G such that any two edges that are at distance 2 or in a common triangle receive distinct colors. The injective chromatic index of G is the minimum number of colors needed to guarantee that G admits an injective edge-coloring. Ferdjallah, Kerdjoudj and Raspaud showed that the injective chromatic index of every subcubic graph is at most 8, and conjectured that 8 can be improved to 6. Kostochka, Raspaud and Xu further proved that every subcubic graph has the injective chromatic index at most 7, and every subcubic planar graph has the injective chromatic index at most 6. In this paper, we consider the injective edge-coloring of claw-free subcubic graphs. We show that every connected claw-free subcubic graph, apart from two exceptions, has the injective chromatic index at most 5. We also consider the list version of injective edge-coloring and prove that the list injective chromatic index of every claw-free subcubic graph is at most 6. Both results are sharp and strengthen a recent result of Yang and Wu which asserts that every claw-free subcubic graph has the injective chromatic index at most 6.

Keywords: Injective edge-coloring; List injective edge-coloring; Claw-free; Subcubic graph; 05C15 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-024-01188-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:47:y:2024:i:5:d:10.1007_s10878-024-01188-w

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-024-01188-w

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().