Acyclic 4-choosability of planar graphs

DOI10.1016/J.DISC.2010.10.003zbMATH Open1216.05028OpenAlexW2135712428MaRDI QIDQ616366FDOQ616366

Min Chen, Nicolas Roussel, Xuding Zhu, André Raspaud

Publication date: 7 January 2011

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

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

zbMATH Keywords

choosabilitycycleplanar graphacyclic coloringacyclic choosability

Mathematics Subject Classification ID

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

Cites Work

• Note to the paper of Grünbaum on acyclic colorings
• On acyclic colorings of planar graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Acyclic Colourings of Planar Graphs with Large Girth
• Acyclic colorings of planar graphs
• Every planar graph has an acyclic 7-coloring
• Every planar graph has an acyclic 8-coloring
• Acyclic 5-choosability of planar graphs without adjacent short cycles
• Title not available (Why is that?)
• Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
• Title not available (Why is that?)
• Acyclic 5-choosability of planar graphs without small cycles
• Planar graphs without 4-cycles are acyclically 6-choosable
• Acyclic list 7‐coloring of planar graphs
• Acyclic 5-choosability of planar graphs without 4-cycles
• Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
• On acyclic 4-choosability of planar graphs without short cycles
• Acyclic 3-choosability of sparse graphs with girth at least 7
• Title not available (Why is that?)
• 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

Cited In (17)

• Flexibility of planar graphs -- sharpening the tools to get lists of size four
• The 4-choosability of planar graphs and cycle adjacency
• Total 4-choosability of series-parallel graphs
• \((4,1)^*\)-choosability of planar graphs
• A sufficient condition for planar graphs to be acyclically 5-choosable
• Planar graphs without 4- and 5-cycles are acyclically 4-choosable
• On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9
• Acyclic coloring of graphs without bichromatic long path
• Choosability with union separation of planar graphs without cycles of length 4
• Acyclic 6-choosability of planar graphs without adjacent short cycles
• On acyclic 4-choosability of planar graphs without short cycles
• Acyclic 4-choosability of planar graphs without intersecting short cycles
• Coloring graphs without bichromatic cycles or paths
• Acyclic 4-choosability of planar graphs without 4-cycles
• \((4,2)\)-choosability of planar graphs with forbidden structures
• Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles
• Title not available (Why is that?)

   Recommendations

• Planar graphs without 4-cycles are acyclically 6-choosable 👍 👎
• On acyclic 4-choosability of planar graphs without short cycles 👍 👎
• Acyclic 5-choosability of planar graphs without 4-cycles 👍 👎
• On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9 👍 👎
• Acyclic 5-choosability of planar graphs without small cycles 👍 👎

This page was built for publication: Acyclic 4-choosability of planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616366)