On the acyclic choosability of graphs

DOI10.1002/jgt.20134zbMath1107.05036OpenAlexW2307903789MaRDI QIDQ5469027

Pascal Ochem, Mickaël Montassier, Andre Raspaud

Publication date: 16 May 2006

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

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

zbMATH Keywords

acyclic coloringlist coloringmaximum average degree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (21)

Acyclic choosability of graphs with bounded degree ⋮ Acyclic 5-choosability of planar graphs without adjacent short cycles ⋮ The method of coloring in graphs and its application ⋮ Planar graphs without 4- and 5-cycles are acyclically 4-choosable ⋮ Every toroidal graph is acyclically 8-choosable ⋮ Acyclic 5-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 edge colouring of planar graphs without short cycles ⋮ A note on the acyclic 3-choosability of some planar graphs ⋮ Acyclic 3-choosability of sparse graphs with girth at least 7 ⋮ What is on his mind? ⋮ Acyclic 4-choosability of planar graphs without adjacent short cycles ⋮ Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable ⋮ Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 ⋮ A polyhedral study of the acyclic coloring problem ⋮ Unnamed Item ⋮ Planar graphs without 4-cycles are acyclically 6-choosable ⋮ Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles ⋮ Acyclic choosability of planar graphs: a Steinberg like approach ⋮ A Conjecture of Borodin and a Coloring of Grünbaum

Cites Work

• Minimum partition of a matroid into independent subsets

This page was built for publication: On the acyclic choosability of graphs