Injective edge chromatic index of sparse graphs

DOI10.1016/J.DAM.2025.03.006MaRDI QIDQ6992287zbMATH OpenFDO

Authors Xiaolan Hu, Guixian Zhang

Publication date 28 April 2025

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

Full work available at URL https://doi.org/10.1016/J.DAM.2025.03.006

zbMATH Keywords

injective edge chromatic indexinjective edge coloringmaximum average degreemaximum degree

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Cites work

• An introduction to the discharging method via graph coloring
• Induced and weak induced arboricities
• Injective edge chromatic number of sparse graphs
• Injective edge coloring of graphs
• Injective edge coloring of graphs with maximum degree 5
• Injective edge coloring of some sparse graphs
• Injective edge coloring of sparse graphs
• Injective edge coloring of sparse graphs with maximum degree 5
• Injective edge-coloring of graphs with given maximum degree
• Injective edge-coloring of subcubic graphs
• Note on injective edge-coloring of graphs
• On injective edge-coloring of graphs with maximum degree 4

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6992287)