On a Lovász-type lemma, applied to Brooks' theorem for list-colouring (Q2275459): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q124827532, #quickstatements; #temporary_batch_1711196317277
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Färbbarkeitskriterium für endliche Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brooks' theorem via the Alon-Tarsi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three short proofs in graph theory / rank
 
Normal rank

Latest revision as of 09:44, 4 July 2024

scientific article
Language Label Description Also known as
English
On a Lovász-type lemma, applied to Brooks' theorem for list-colouring
scientific article

    Statements

    On a Lovász-type lemma, applied to Brooks' theorem for list-colouring (English)
    0 references
    0 references
    9 August 2011
    0 references
    0 references
    \(k\)-regular graphs
    0 references
    graph colouring
    0 references
    list-colouring
    0 references
    Brooks' theorem
    0 references
    0 references
    0 references