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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2011.05.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089427484 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q124827532 / rank
 
Normal rank
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