The 4-choosability of plane graphs without 4-cycles (Q1305526): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139765 / 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: Q3115277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List colourings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A not 3-choosable planar graph without 3-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3122897 / rank
 
Normal rank

Revision as of 09:27, 29 May 2024

scientific article
Language Label Description Also known as
English
The 4-choosability of plane graphs without 4-cycles
scientific article

    Statements

    The 4-choosability of plane graphs without 4-cycles (English)
    0 references
    0 references
    0 references
    0 references
    4 October 1999
    0 references
    faces
    0 references
    choosabiilty
    0 references
    triangle
    0 references
    vertex coloring
    0 references
    plane graph
    0 references
    4-cycles
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references