Acyclic 4-choosability of planar graphs without adjacent short cycles

DOI10.1016/j.disc.2012.07.038zbMath1252.05041OpenAlexW1964561990MaRDI QIDQ713156

Anna O. Ivanova, Oleg V. Borodin

Publication date: 26 October 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.07.038

zbMATH Keywords

planar graphchoosabilityacyclic coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

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 with No 4‐ and 5‐Cycles ⋮ Unnamed Item ⋮ Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• List colourings 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 3-choosability of planar graphs with no cycles of length from 4 to 11
• On acyclic 4-choosability of planar graphs without short cycles
• Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
• 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
• Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable
• A sufficient condition for planar graphs to be acyclically 5-choosable
• Acyclic 5-choosability of planar graphs without adjacent short cycles
• 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 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles
• On the acyclic choosability of graphs
• Acyclic 5-choosability of planar graphs without 4-cycles
• Acyclic 5-choosability of planar graphs without 4-cycles
• Acyclic colorings of planar graphs
• 25 pretty graph colouring problems