Strong edge colouring of subcubic graphs

DOI10.1016/J.DAM.2011.06.015zbMath1228.05152OpenAlexW1969425709MaRDI QIDQ642999

Hervé Hocquard, Petru Valicov

Publication date: 27 October 2011

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

Full work available at URL: https://doi.org/10.1016/j.dam.2011.06.015

zbMATH Keywords

subcubic graphsmaximum average degreestrong edge colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (13)

On the strong chromatic index of sparse graphs ⋮ Strong chromatic index of graphs with maximum degree four ⋮ On strong edge-coloring of graphs with maximum degree 4 ⋮ On strong list edge coloring of subcubic graphs ⋮ Strong edge-coloring of subcubic planar graphs ⋮ On strong edge-colouring of subcubic graphs ⋮ Strong list edge coloring of subcubic graphs ⋮ Strong chromatic index of subcubic planar multigraphs ⋮ Proof of a conjecture on the strong chromatic index of Halin graphs ⋮ Strong edge-coloring of pseudo-Halin graphs ⋮ Strong edge-coloring of planar graphs ⋮ Recent progress on strong edge-coloring of graphs ⋮ Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors

Cites Work

• Induced matchings in bipartite graphs
• The strong chromatic index ofC4-free graphs
• Unnamed Item

This page was built for publication: Strong edge colouring of subcubic graphs