The last excluded case of Dirac's map‐color theorem for choosability (Q5469029): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57601539, #quickstatements; #temporary_batch_1711439739529
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Generalized list colourings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Proof of a Map-Colour Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Brooks-Type Theorem for the Generalized List T-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Six Color Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colorings with local constraints -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4376970 / rank
 
Normal rank

Revision as of 13:12, 24 June 2024

scientific article; zbMATH DE number 5023704
Language Label Description Also known as
English
The last excluded case of Dirac's map‐color theorem for choosability
scientific article; zbMATH DE number 5023704

    Statements

    The last excluded case of Dirac's map‐color theorem for choosability (English)
    0 references
    0 references
    0 references
    16 May 2006
    0 references
    graph coloring
    0 references
    list coloring
    0 references
    Heawood's formula
    0 references
    Dirac's map-color theorem
    0 references
    graphs on surfaces
    0 references

    Identifiers