Journal of Graph Theory · 2002 · 65 citations · 10 references
Natural SciencesMathematicsCombinatoricsGeometryDirected Acyclic GraphsGraph ColoringGraph TheoryAcyclic ColoringChromatic PolynomialsColoring Planar GraphsColoring TheoremsGraph Theory AnalysisList Coloring
Abstract The acyclic list chromatic number of every planar graph is proved to be at most 7. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 83–90, 2002
10
Choice Reviews Online · 1995 · 1.3K citations
Every Planar Graph Is 5-Choosable
Carsten Thomassen · Journal of Combinatorial Theory Series B · 1994 · 516 citations
Acyclic colorings of planar graphs
Branko Grünbaum · Israel Journal of Mathematics · 1973 · 406 citations
On acyclic colorings of planar graphs
O. V. Borodin · Discrete Mathematics · 1979 · 265 citations
On acyclic colorings of planar graphs
O. V. Borodin · Discrete Mathematics · 2006 · 236 citations