On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9 (Q2032901): 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 5-choosability of planar graphs without 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles / 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: A sufficient condition for planar graphs to be acyclically 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without 4- and 5-cycles are acyclically 4-choosable / 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: An introduction to the discharging method via graph coloring / 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: The 4-choosability of plane graphs without 4-cycles / 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: Acyclic 4-choosability of planar graphs without intersecting short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic 4-choosability of planar graphs without 4-cycles / 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 6-choosability of planar graphs without adjacent short 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

Revision as of 23:10, 25 July 2024

scientific article
Language Label Description Also known as
English
On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9
scientific article

    Statements

    On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9 (English)
    0 references
    0 references
    0 references
    0 references
    14 June 2021
    0 references
    planar graphs
    0 references
    acyclic coloring
    0 references
    acyclic choosability
    0 references
    cycle
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references