Injective edge chromatic number of sparse graphs

DOI10.1016/j.amc.2024.128668MaRDI QIDQ6585500zbMATH OpenFDO

Authors Junlei Zhu, Hongguo Zhu, Yuehua Bu

Publication date 12 August 2024

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2024.128668

zbMATH Keywords

graphinjective edge coloringmaximum average degree

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Injective edge coloring of sparse graphs with maximum degree 5
• Injective chromatic index of sparse graphs
• Injective edge coloring of graphs with maximum degree 5
• Injective edge coloring of sparse graphs
• On injective edge-coloring of graphs with maximum degree 4

Cites work

• Injective edge coloring of graphs
• Injective edge coloring of graphs with maximum degree 5
• 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
• Note on injective edge-coloring of graphs

Cited in

(8)

• Injective chromatic index of sparse graphs
• Injective chromatic index of K₄-minor free graphs
• On injective edge-coloring of graphs with maximum degree 4
• On injective edge coloring for a class of graphs with maximum degree 5
• On injective edge coloring of sparse graphs with maximum degree 5
• Injective edge chromatic index of sparse graphs
• The injective chromatic index of planar graphs with maximum degree 4
• Some bounds on the injective edge chromatic number

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

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