A sufficient condition for planar graphs to be acyclically 5-choosable
From MaRDI portal
Publication:2888884
DOI10.1002/jgt.20604zbMath1242.05089MaRDI QIDQ2888884
Publication date: 4 June 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20604
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Unnamed Item, Acyclic 4-choosability of planar graphs without intersecting short cycles, Acyclic 5-choosability of planar graphs without 4-cycles, Acyclic 6-choosability of planar graphs without adjacent short cycles, Acyclic 4-choosability of planar graphs without adjacent short cycles, Acyclic coloring of graphs without bichromatic long path, Planar graphs without 4- and 5-cycles are acyclically 4-choosable
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acyclic 4-choosability of planar graphs
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
- Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11
- On acyclic 4-choosability of planar graphs without short cycles
- Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
- Note to the paper of Grünbaum on acyclic colorings
- Every planar graph has an acyclic 7-coloring
- On acyclic colorings of planar graphs
- Every planar graph is 5-choosable
- Every planar graph has an acyclic 8-coloring
- Acyclic 5-choosability of planar graphs without small cycles
- Planar graphs without 4-cycles are acyclically 6-choosable
- Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
- Acyclic Colourings of Planar Graphs with Large Girth
- Acyclic list 7‐coloring of planar graphs
- Acyclic 5-choosability of planar graphs without 4-cycles
- Acyclic colorings of planar graphs
