Injective edge chromatic number of sparse graphs

Junlei Zhu, Hongguo Zhu and Yuehua Bu

Applied Mathematics and Computation, 2024, vol. 473, issue C

Abstract: A k-edge coloring ϕ of graph G is injective if any two edges at distance 2 or in the same triangle get different colors. The minimum k in such an edge coloring is the injective edge chromatic number of G, written as χi′(G). We prove in this paper that for any graph G with Δ(G)≤5, χi′(G)≤18 if mad(G)<165, χi′(G)≤19 if mad(G)<72 and χi′(G)≤20 if mad(G)<154.

Keywords: Injective edge coloring; Graph; Maximum average degree (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324001401
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:473:y:2024:i:c:s0096300324001401

DOI: 10.1016/j.amc.2024.128668

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().