A sufficient condition for planar graphs to be acyclically 5-choosable (Q2888884): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Every planar graph has an acyclic 7-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / 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: Acyclic Colourings of Planar Graphs with Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable / 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 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic 4-choosability of planar graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic 4-choosability of planar graphs / 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: 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: Acyclic 5-choosability of planar graphs without small cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without 4-cycles are acyclically 6-choosable / 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 07:57, 5 July 2024

scientific article
Language Label Description Also known as
English
A sufficient condition for planar graphs to be acyclically 5-choosable
scientific article

    Statements

    A sufficient condition for planar graphs to be acyclically 5-choosable (English)
    0 references
    0 references
    0 references
    0 references
    4 June 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    acyclic coloring
    0 references
    acyclic choosability
    0 references
    planar graph
    0 references
    intersecting triangles
    0 references
    0 references