Acyclic 5-choosability of planar graphs without 4-cycles

DOI10.1016/j.disc.2007.11.076zbMath1189.05059OpenAlexW2014033704MaRDI QIDQ5901353

Wei Fan Wang, Min Chen

Publication date: 28 January 2009

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

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

zbMATH Keywords

planar graphacyclic coloringlist coloringacyclic choosability

Mathematics Subject Classification ID

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

Related Items

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 ⋮ An improved upper bound for the acyclic chromatic number of 1-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 ⋮ What is on his mind? ⋮ 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 ⋮ Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable ⋮ 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 ⋮ Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles ⋮ Acyclic choosability of planar graphs: a Steinberg like approach

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• 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 colorings of planar graphs