Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles

DOI10.1002/jgt.21647zbMath1261.05013OpenAlexW1751769298MaRDI QIDQ4916098

Oleg V. Borodin, Anna O. Ivanova

Publication date: 19 April 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21647

zbMATH Keywords

planar graphchoosabilityacyclic coloringforbidden cycle

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 (14)

Acyclic choosability of graphs with bounded degree ⋮ Acyclically 4-colorable triangulations ⋮ Construction of acyclically 4-colourable planar triangulations with minimum degree 4 ⋮ Acyclic 5-choosability of planar graphs without adjacent short cycles ⋮ Acyclic 6-choosability of planar graphs without adjacent short cycles ⋮ Acyclic 5-choosability of planar graphs without 4-cycles ⋮ An introduction to the discharging method via graph coloring ⋮ Acyclic 4-choosability of planar graphs without adjacent short cycles ⋮ Equitable partition of planar graphs ⋮ Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 ⋮ 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 ⋮ On acyclically 4-colorable maximal planar graphs

Cites Work

• 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 4-choosability of planar graphs without adjacent short cycles
• A non-3-choosable planar graph without cycles of length 4 and 5
• 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
• The 4-choosability of plane graphs without 4-cycles
• Every planar graph is 5-choosable
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Every planar graph has an acyclic 8-coloring
• 3-list-coloring planar graphs of girth 5
• A not 3-choosable planar graph without 3-cycles
• 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
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• 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

This page was built for publication: Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles