5-choosability of graphs with crossings far apart (Q505910): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: You can't paint yourself into a corner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with Two Crossings Are 5-Choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: 5-list-coloring planar graphs with distant precolored vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-list-coloring planar graphs of girth 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List colourings of planar graphs / rank
 
Normal rank

Latest revision as of 08:02, 13 July 2024

scientific article
Language Label Description Also known as
English
5-choosability of graphs with crossings far apart
scientific article

    Statements

    5-choosability of graphs with crossings far apart (English)
    0 references
    0 references
    0 references
    0 references
    26 January 2017
    0 references
    chromatic number
    0 references
    crossing number
    0 references
    list coloring
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references