Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles

DOI10.1016/j.disc.2010.07.001zbMath1209.05063OpenAlexW2052789275MaRDI QIDQ710596

Anna O. Ivanova, Oleg V. Borodin, Andre Raspaud

Publication date: 19 October 2010

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

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

zbMATH Keywords

planar graphacyclic coloringacyclic choosability

Mathematics Subject Classification ID

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 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 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
• 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 3-choosability of planar graphs with no cycles of length from 4 to 11
• 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
• 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 small cycles
• 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
• Acyclic 5-choosability of planar graphs without 4-cycles
• Acyclic colorings of planar graphs
• 25 pretty graph colouring problems

This page was built for publication: Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles