Remark on injective edge-coloring of some sparse graphs
Filomat · 2025 · 39 (19) · 6763-6770
DOI: 10.2298/fil2519763n ↗Kurz gefasst
Fachartikel in der Zeitschrift Filomat, 2025. Verfasst von Bei Niu. Die Arbeit nennt 13 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC0).
Abstract (Originalsprache)
A k -edge coloring of a graph G is considered injective if any two edges that are at distance 2 or reside within the same triangle receive distinct colors. The minimum integer k for which G admits a k -injective-edge coloring is referred to as the injective edge chromatic number of G, denoted by \chi_i'(G) . This paper presents findings on the injective edge chromatic numbers for graphs with maximum degrees of 4 and 5. In particular, we show that if the maximum average degree mad(G) of a graph G, where the maximum degree is 4, is less than 38/11 , then it follows that \chi_i'(G) \leq 13 , thereby enhancing the previous result established by Bu and Qi [Discrete Math. Algorithms Appl., 2018]. Additionally, we prove that for any graph G with a maximum degree of 5, it holds true that if mad(G) < 1501/384, then \chi_i'(G) \leq 21 , furthermore, if mad(G) < 4, then also \chi_i'(G) \leq 22 .
Zitieren
APA
Niu, B. (2025). Remark on injective edge-coloring of some sparse graphs. Filomat, 39(19), 6763-6770. https://doi.org/10.2298/fil2519763n
Vancouver
Niu B. Remark on injective edge-coloring of some sparse graphs. Filomat. 2025;39(19):6763-6770. doi:10.2298/fil2519763n
BibTeX
@article{Niu2025,
author = {Niu, Bei},
title = {Remark on injective edge-coloring of some sparse graphs},
journal = {Filomat},
year = {2025},
volume = {39},
number = {19},
pages = {6763--6770},
doi = {10.2298/fil2519763n}
}
EUVIMED