SIAM Journal on Discrete Mathematics · 2009 · 36 citations · 9 references
Natural SciencesMathematicsCombinatoricsDiscrete MathematicsGeometric GraphsGraph AlgorithmsGraph TheoryPlanar Graph AlgorithmsPlanar Graphs
In this paper, we show that every planar graph without 7-cycles is 4-choosable.MSC codes05C1505C10Keywordsplanar graphscoloringchoosability
9
Every Planar Graph Is 5-Choosable
Carsten Thomassen · Journal of Combinatorial Theory Series B · 1994 · 516 citations
List colourings of planar graphs
Margit Voigt · Discrete Mathematics · 1993 · 226 citations
List colourings of planar graphs
Margit Voigt · Discrete Mathematics · 2006 · 194 citations
The complexity of planar graph choosability
Shai Gutner · Discrete Mathematics · 1996 · 101 citations