Acyclic 3-choosability of sparse graphs with girth at least 7

DOI10.1016/j.disc.2010.05.032zbMath1213.05049OpenAlexW2030151828MaRDI QIDQ708400

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

Publication date: 11 October 2010

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

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

zbMATH Keywords

graph coloringchoosabilityacyclic coloringsparse graph

Mathematics Subject Classification ID

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

Related Items (14)

Parallelization strategies for computational fluid dynamics software: state of the art review ⋮ Acyclic 5-choosability of planar graphs without adjacent short cycles ⋮ Acyclic 4-choosability of planar graphs ⋮ Hardness transitions and uniqueness of acyclic colouring ⋮ Planar graphs without 4- and 5-cycles are acyclically 4-choosable ⋮ Acyclic 5-choosability of planar graphs without 4-cycles ⋮ List strong linear 2-arboricity of sparse graphs ⋮ An introduction to the discharging method via graph coloring ⋮ Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles ⋮ A note on the acyclic 3-choosability of some planar graphs ⋮ Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles ⋮ Acyclic 4-choosability of planar graphs without adjacent short cycles ⋮ On acyclic 4-choosability of planar graphs without short cycles ⋮ 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
• List colourings of planar graphs
• 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
• Note to the paper of Grünbaum on acyclic colorings
• On acyclic colorings of planar graphs
• Every planar graph is 5-choosable
• 3-list-coloring planar graphs of girth 5
• A not 3-choosable planar graph without 3-cycles
• An oriented 7-colouring of planar graphs with girth at least 7
• List strong linear 2-arboricity of sparse graphs
• Acyclic 5-choosability of planar graphs without adjacent short 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
• On the acyclic choosability of graphs
• 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 3-choosability of sparse graphs with girth at least 7