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

DOI10.1016/j.disc.2011.05.021zbMath1223.05087OpenAlexW2089427484WikidataQ124827532 ScholiaQ124827532MaRDI QIDQ2275459

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

graph colouringlist-colouringBrooks' theorem\(k\)-regular graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Critically paintable, choosable or colorable graphs

Cites Work

• Unnamed Item
• Brooks' theorem via the Alon-Tarsi theorem
• Three short proofs in graph theory
• Combinatorial Nullstellensatz
• Ein Färbbarkeitskriterium für endliche Graphen

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