Injective edge coloring of sparse graphs with maximum degree 5

DOI10.1007/S10878-022-00972-WMaRDI QIDQ2111524zbMATH OpenOpenAlexWikidataFDO

Authors Junlei Zhu, Yuehua Bu, Hongguo Zhu

Publication date 17 January 2023

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-022-00972-w

zbMATH Keywords

maximum degreemaximum average degreeinjective edge coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Recommendations

• Injective edge coloring of graphs with maximum degree 5
• Injective edge coloring of sparse graphs
• Note on injective edge-coloring of graphs
• Injective colorings of sparse graphs
• Injective colorings of graphs with low average degree

Cites work

• Complexity and algorithms for injective edge-coloring in graphs
• Induced and weak induced arboricities
• Injective edge coloring of graphs
• Injective edge coloring of planar graphs
• Injective edge coloring of sparse graphs
• 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

(10)

• Injective edge-coloring of graphs with given maximum degree
• Injective edge coloring of graphs with maximum degree 5
• Injective chromatic index of \(K_4\)-minor free graphs
• Injective colorings of sparse graphs
• Injective edge chromatic number of sparse graphs
• On injective edge-coloring of graphs with maximum degree 4
• Injective chromatic index of sparse graphs
• Injective edge coloring of some sparse graphs
• Injective edge coloring of sparse graphs
• Injective edge coloring for graphs with small edge weight

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

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