Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (Q2444905): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on list improper coloring of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-colorability of planar graphs without cycles of length 4, 6 and 9 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on list improper coloring planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Improper Colourings of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Grötzsch-Type Theorem for List Colourings with Impropriety One / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without 4, 6, 8-cycles are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improper colorability of planar graphs with cycles of length neither 4 nor 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On $(3,1)^*$-Coloring of Plane Graphs / rank
 
Normal rank

Latest revision as of 15:17, 7 July 2024

scientific article
Language Label Description Also known as
English
Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
scientific article

    Statements

    Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (English)
    0 references
    0 references
    0 references
    11 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial problems
    0 references
    planar graph
    0 references
    cycle
    0 references
    improper coloring
    0 references
    0 references