Acyclic list 7‐coloring of planar graphs
From MaRDI portal
Publication:4539872
DOI10.1002/jgt.10035zbMath1004.05029MaRDI QIDQ4539872
Eric Sopena, Alexandr V. Kostochka, Oleg V. Borodin, Andre Raspaud, Dmitry G. Fon-Der-Flaass
Publication date: 11 July 2002
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10035
05C15: Coloring of graphs and hypergraphs
Related Items
Acyclic 5-choosability of planar graphs without 4-cycles, Acyclic 5-choosability of planar graphs without 4-cycles, Acyclic 4-choosability of planar graphs, Improved bounds on linear coloring of plane graphs, Acyclic vertex coloring of graphs of maximum degree 5, 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 with neither 4-cycles nor triangular 6-cycles, Acyclic colorings of subcubic graphs, Linear choosability of graphs, On acyclic 4-choosability of planar graphs without short cycles, Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable, Linear coloring of planar graphs with large girth, Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles, A sufficient condition for planar graphs to be acyclically 5-choosable, Acyclic 5-choosability of planar graphs without adjacent short cycles, A Conjecture of Borodin and a Coloring of Grünbaum, Acyclic improper choosability of graphs, Planar graphs without 4-cycles are acyclically 6-choosable
Cites Work
