Planar graphs without 4-cycles are acyclically 6-choosable
From MaRDI portal
Publication:3652536
DOI10.1002/jgt.20381zbMath1185.05068OpenAlexW4231198428MaRDI QIDQ3652536
Publication date: 18 December 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20381
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (15)
A sufficient condition for planar graphs to be acyclically 5-choosable ⋮ Acyclic 4-choosability of planar graphs ⋮ An improved upper bound for the acyclic chromatic number of 1-planar graphs ⋮ Acyclic 4-choosability of planar graphs without intersecting short cycles ⋮ Planar graphs without 4- and 5-cycles are acyclically 4-choosable ⋮ Every toroidal graph is acyclically 8-choosable ⋮ Acyclic 6-choosability of planar graphs without adjacent short cycles ⋮ Acyclic 4-choosability of planar graphs without 4-cycles ⋮ Acyclic 5-choosability of planar graphs without 4-cycles ⋮ Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles ⋮ Acyclic 4-choosability of planar graphs without adjacent short cycles ⋮ On acyclic 4-choosability of planar graphs without short cycles ⋮ On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9 ⋮ Unnamed Item ⋮ Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles
Cites Work
- Unnamed Item
- List colourings of planar graphs
- 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
- Acyclic Colourings of Planar Graphs with Large Girth
- Acyclic list 7‐coloring of planar graphs
- On the acyclic choosability of graphs
- Acyclic colorings of planar graphs
- Acyclic colouring of 1-planar graphs
This page was built for publication: Planar graphs without 4-cycles are acyclically 6-choosable