Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable (Q1988563): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s40840-019-00819-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2965948659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective 2-colorings of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs with girth at least 5 are \((3, 5)\)-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: (1,<i>k</i>)-Coloring of Graphs with Girth at Least Five on a Surface / 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: Q4230860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improper choosability of graphs and maximum average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-colorings: non-colorable graphs and NP-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective 2-colorings of planar graphs without 4-cycles and 5-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:36, 22 July 2024

scientific article
Language Label Description Also known as
English
Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable
scientific article

    Statements

    Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable (English)
    0 references
    0 references
    0 references
    23 April 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    improper coloring
    0 references
    planar graph
    0 references
    discharging method
    0 references
    0 references