Injective edge coloring of graphs with maximum degree 5

DOI10.1016/j.dam.2023.03.022zbMath1512.05150OpenAlexW4360801383WikidataQ122178739 ScholiaQ122178739MaRDI QIDQ6157424

Junlei Zhu

Publication date: 11 May 2023

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

Full work available at URL: https://doi.org/10.1016/j.dam.2023.03.022

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)

Related Items (1)

Injective chromatic index of sparse graphs

Cites Work

• Unnamed Item
• Induced and weak induced arboricities
• List star edge coloring of sparse graphs
• 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 graphs with small weight
• Injective edge coloring for graphs with small edge weight
• Injective edge coloring of sparse graphs
• Injective edge coloring of graphs

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