Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles (Q710596): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4000782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph has an acyclic 7-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4137202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar 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: Acyclic Colourings of Planar Graphs with Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic list 7‐coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without cycles of length from 4 to 7 are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic 3-choosability of sparse graphs with girth at least 7 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic 5-choosability of planar graphs without 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note to the paper of Grünbaum on acyclic colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph has an acyclic 8-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic 5-choosability of planar graphs without small cycles / 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: 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: Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles / rank
 
Normal rank

Latest revision as of 08:14, 3 July 2024

scientific article
Language Label Description Also known as
English
Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
scientific article

    Statements

    Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles (English)
    0 references
    0 references
    0 references
    0 references
    19 October 2010
    0 references
    planar graph
    0 references
    acyclic coloring
    0 references
    acyclic choosability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers