Injective edge coloring of sparse graphs

DOI10.1142/S1793830918500222zbMath1383.05094WikidataQ114071645 ScholiaQ114071645MaRDI QIDQ4634525

Chentao Qi, Yuehua Bu

Publication date: 10 April 2018

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

maximum average degreesparse graphinjective 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 (13)

Injective edge coloring of generalized Petersen graphs ⋮ Injective edge coloring of some sparse graphs ⋮ Injective edge coloring of power graphs and necklaces ⋮ Injective edge-coloring of subcubic graphs ⋮ Complexity and algorithms for injective edge coloring of graphs ⋮ Injective chromatic index of sparse graphs ⋮ Injective edge coloring of graphs with maximum degree 5 ⋮ Unnamed Item ⋮ Complexity and algorithms for injective edge-coloring in graphs ⋮ Injective edge-coloring of graphs with given maximum degree ⋮ Note on injective edge-coloring of graphs ⋮ Injective edge-coloring of graphs with small weight ⋮ Injective edge coloring of sparse graphs with maximum degree 5

Cites Work

• Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6
• On the injective chromatic number of graphs

This page was built for publication: Injective edge coloring of sparse graphs