Injective chromatic index of sparse graphs

DOI10.1016/J.DAM.2023.11.027MaRDI QIDQ6145804zbMATH OpenFDO

Authors

Publication date 9 January 2024

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

zbMATH Keywords

maximum degreemaximum average degreeinjective-edge coloring

Mathematics Subject Classification ID

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

Recommendations

• Injective edge coloring of sparse graphs with maximum degree 5
• Injective edge coloring of graphs with maximum degree 5
• Injective edge chromatic number of sparse graphs
• Injective edge coloring of sparse graphs
• Injective colorings of sparse graphs

Cites work

• Complexity and algorithms for injective edge-coloring in graphs
• Injective edge coloring for graphs with small edge weight
• Injective edge coloring of graphs
• Injective edge coloring of graphs with maximum degree 5
• Injective edge coloring of planar 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
• List injective edge-coloring of subcubic graphs
• Note on injective edge-coloring of graphs

Cited in

(4)

• Injective chromatic index of \(K_4\)-minor free graphs
• Injective edge chromatic number of sparse graphs
• Injective edge coloring of power graphs and necklaces
• Injective edge chromatic index of generalized Petersen graph \(P(ck,k)\)

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

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