On a Lovász-type lemma, applied to Brooks' theorem for list-colouring

DOI10.1016/J.DISC.2011.05.021MaRDI QIDQ2275459zbMATH OpenOpenAlexWikidataFDO

Authors Helge Tverberg

Publication date 9 August 2011

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Brooks' theoremgraph colouringlist-colouring\(k\)-regular graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Brooks' Theorem and Beyond
• Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms
• A different short proof of Brooks' theorem
• Brooks' theorem via the Alon-Tarsi theorem
• The colour theorems of Brooks and Gallai extended

Cites work

• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• Brooks' theorem via the Alon-Tarsi theorem
• Combinatorial Nullstellensatz
• Ein Färbbarkeitskriterium für endliche Graphen
• Three short proofs in graph theory

Cited in

(6)

• A different short proof of Brooks' theorem
• Dirac's theorem on chordal graphs implies Brooks' theorem
• Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms
• A Grötzsch-Type Theorem for List Colourings with Impropriety One
• Critically paintable, choosable or colorable graphs
• scientific article; zbMATH DE number 54806 (Why is no real title available?)

This page was built for publication: On a Lovász-type lemma, applied to Brooks' theorem for list-colouring

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