List-colouring the square of a \(K_4\)-minor-free graph

DOI10.1016/j.disc.2007.07.102zbMath1155.05024OpenAlexW1555403707MaRDI QIDQ941324

Timothy J. Hetherington, Douglas R. Woodall

Publication date: 4 September 2008

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

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

zbMATH Keywords

choosabilityminor-free graphlist square colouring

Mathematics Subject Classification ID

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

Related Items

Graph \(r\)-hued colorings -- a survey ⋮ A unified approach to distance-two colouring of graphs on surfaces ⋮ Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) ⋮ On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs ⋮ A Brooks-type bound for squares of \(K_{4}\)-minor-free graphs

Cites Work

• Unnamed Item
• Choosability of powers of circuits
• Coloring the square of a \(K_{4}\)-minor free graph
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Choosability conjectures and multicircuits

This page was built for publication: List-colouring the square of a \(K_4\)-minor-free graph