Planar Graphs Without 4-Cycles Adjacent to Triangles are DP-4-Colorable

Every Planar Graph Is 5-Choosable

Carsten Thomassen · Journal of Combinatorial Theory Series B · 1994 · 516 citations

Natural Sciences, Mathematics, Combinatorics +7

Signed graph coloring

Thomas Zasĺavsky · Discrete Mathematics · 1982 · 148 citations

A not 3-choosable planar graph without 3-cycles

Margit Voigt · Discrete Mathematics · 1995 · 126 citations

Natural Sciences, Mathematics, Combinatorics +9

Degrees and choice numbers

Noga Alon · Random Structures and Algorithms · 2000 · 87 citations

Natural Sciences, Mathematics, Combinatorics +4

The 4-Choosability of Plane Graphs without 4-Cycles

Peter Che Bor Lam, Baogang Xu · Journal of Combinatorial Theory Series B · 1999 · 81 citations

Natural Sciences, Computer Science, Mathematics +9