On injective edge-coloring of graphs with maximum degree 4

DOI10.1016/j.dam.2024.09.005MaRDI QIDQ6648253

Jian-Bo Lv, Jiacong Fu

Publication date: 4 December 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

sparse graphsmaximum average degreeinjective edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Density (toughness, etc.) (05C42)

Cites Work

• An introduction to the discharging method via graph coloring
• Induced and weak induced arboricities
• 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 graphs with small weight
• Injective edge coloring of sparse graphs with maximum degree 5
• Injective edge coloring for graphs with small edge weight
• Injective edge coloring of sparse graphs
• Injective edge coloring of graphs
• Injective edge coloring of some sparse graphs
• Injective edge-coloring of subcubic graphs
• Injective edge coloring of graphs with maximum degree 5
• Injective chromatic index of \(K_4\)-minor free graphs

This page was built for publication: On injective edge-coloring of graphs with maximum degree 4