On acyclic 4-choosability of planar graphs without short cycles
From MaRDI portal
Publication:982617
DOI10.1016/j.disc.2010.03.036zbMath1221.05075OpenAlexW2093564984MaRDI QIDQ982617
Publication date: 7 July 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.03.036
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (12)
A sufficient condition for planar graphs to be acyclically 5-choosable ⋮ Acyclic 5-choosability of planar graphs without adjacent short cycles ⋮ Acyclic 4-choosability of planar graphs ⋮ Acyclic 4-choosability of planar graphs without intersecting short cycles ⋮ Planar graphs without 4- and 5-cycles are acyclically 4-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 3-choosability of sparse graphs with girth at least 7 ⋮ Acyclic 4-choosability of planar graphs without adjacent short cycles ⋮ On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9
Cites Work
- Acyclic 4-choosability of planar graphs
- Acyclic 3-choosability of sparse graphs with girth at least 7
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-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 has an acyclic 8-coloring
- Acyclic 5-choosability of planar graphs without small cycles
- Planar graphs without 4-cycles are acyclically 6-choosable
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On acyclic 4-choosability of planar graphs without short cycles