A Brooks-type bound for squares of \(K_{4}\)-minor-free graphs

DOI10.1016/j.disc.2009.07.004zbMath1198.05061OpenAlexW2081421959MaRDI QIDQ1045198

Douglas R. Woodall, Alexandr V. Kostochka, Lale Özkahya

Publication date: 15 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.07.004

zbMATH Keywords

chromatic numbervertex coloringseries-parallel graphsquare of a graphBrooks-type bound

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Related Items (2)

Graph \(r\)-hued colorings -- a survey ⋮ Bounding the chromatic number of squares of \(K_4\)-minor-free graphs

Cites Work

• List-colouring the square of a \(K_4\)-minor-free graph
• Coloring the square of a \(K_{4}\)-minor free graph
• List Colouring Squares of Planar Graphs
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Choosability conjectures and multicircuits

This page was built for publication: A Brooks-type bound for squares of \(K_{4}\)-minor-free graphs