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

DOI10.1016/J.DISC.2011.05.021zbMATH Open1223.05087OpenAlexW2089427484WikidataQ124827532 ScholiaQ124827532MaRDI QIDQ2275459FDOQ2275459

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Three short proofs in graph theory
• Combinatorial Nullstellensatz
• Brooks' theorem via the Alon-Tarsi theorem
• Ein Färbbarkeitskriterium für endliche Graphen

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
• Title not available (Why is that?)

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)