Strong edge coloring of subquartic graphs

DOI10.1007/978-3-031-49614-1_9MaRDI QIDQ6606224

Hongguo Zhu, Junlei Zhu

Publication date: 16 September 2024

zbMATH Keywords

maximum average degreestrong edge coloringsubquartic graph

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Strong edge coloring sparse graphs
• The strong chromatic index of a cubic graph is at most 10
• A bound on the strong chromatic index of a graph
• On the computational complexity of strong edge coloring
• Strong chromatic index of graphs with maximum degree four
• On strong edge-coloring of graphs with maximum degree 4
• Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors
• Colouring graphs with sparse neighbourhoods: bounds and applications
• Strong edge-colorings of sparse graphs with large maximum degree
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• On strong edge-colouring of subcubic graphs
• List strong edge coloring of some classes of graphs
• A Stronger Bound for the Strong Chromatic Index
• Induced matchings in cubic graphs

This page was built for publication: Strong edge coloring of subquartic graphs