Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217): 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: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings of plane graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for planar graphs to be 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steinberg's conjecture is false / 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: Q4857375 / 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: Q3139765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improper Choosability of Planar Graphs without 4-Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On $(3,1)^*$-Coloring of Plane Graphs / rank
 
Normal rank

Latest revision as of 00:21, 15 July 2024

scientific article
Language Label Description Also known as
English
Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable
scientific article

    Statements

    Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 January 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    \((k, d)\)-coloring
    0 references
    Nsk3CC
    0 references
    reducible configuration
    0 references
    graph operation
    0 references
    bad cycles
    0 references
    super extension
    0 references
    0 references