On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9
From MaRDI portal
Publication:2032901
DOI10.1016/j.disc.2021.112476zbMath1466.05069OpenAlexW3165193458MaRDI QIDQ2032901
Yanfang He, Yingcai Sun, Min Chen
Publication date: 14 June 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112476
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acyclic 6-choosability of planar graphs without adjacent short cycles
- An introduction to the discharging method via graph coloring
- Acyclic 4-choosability of planar graphs
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
- On acyclic 4-choosability of planar graphs without short cycles
- Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
- Every planar graph has an acyclic 7-coloring
- On acyclic colorings of planar graphs
- The 4-choosability of plane graphs without 4-cycles
- Every planar graph has an acyclic 8-coloring
- Planar graphs without 4- and 5-cycles are acyclically 4-choosable
- A sufficient condition for planar graphs to be acyclically 5-choosable
- Acyclic 4-choosability of planar graphs without 4-cycles
- Acyclic 5-choosability of planar graphs without small cycles
- Planar graphs without 4-cycles are acyclically 6-choosable
- Acyclic list 7‐coloring of planar graphs
- Acyclic 4-choosability of planar graphs without intersecting short cycles
- Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles
- Acyclic 5-choosability of planar graphs without 4-cycles
- Acyclic 5-choosability of planar graphs without 4-cycles
- Acyclic colorings of planar graphs
This page was built for publication: On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9
