Injective edge coloring of sparse graphs with maximum degree 5

DOI10.1007/s10878-022-00972-wOpenAlexW4313655781WikidataQ123223568 ScholiaQ123223568MaRDI QIDQ2111524

Yuehua Bu, Hongguo Zhu, Junlei Zhu

Publication date: 17 January 2023

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-022-00972-w

zbMATH Keywords

maximum degreemaximum average degreeinjective edge coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Density (toughness, etc.) (05C42)

Related Items (2)

Injective edge coloring of some sparse graphs ⋮ Injective chromatic index of sparse graphs

Cites Work

• Unnamed Item
• Induced and weak induced arboricities
• Complexity and algorithms for injective edge-coloring in graphs
• Injective edge-coloring of graphs with given maximum degree
• List injective edge-coloring of subcubic graphs
• Note on injective edge-coloring of graphs
• Injective edge coloring of sparse graphs
• Injective edge coloring of graphs

This page was built for publication: Injective edge coloring of sparse graphs with maximum degree 5