On the acyclic choosability of graphs

DOI10.1002/jgt.20134zbMath1107.05036MaRDI 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 coloring; list coloring; maximum average degree

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles, Acyclic 5-choosability of planar graphs without 4-cycles, Acyclic 5-choosability of planar graphs without 4-cycles, A polyhedral study of the acyclic coloring problem, 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, Acyclic edge colouring of planar graphs without short cycles, 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, Planar graphs without 4- and 5-cycles are acyclically 4-choosable, The method of coloring in graphs and its application, Every toroidal graph is acyclically 8-choosable, Acyclic choosability of planar graphs: a Steinberg like approach, Acyclic 5-choosability of planar graphs without adjacent short cycles, A Conjecture of Borodin and a Coloring of Grünbaum, Planar graphs without 4-cycles are acyclically 6-choosable

Cites Work

• Minimum partition of a matroid into independent subsets