Equitable partition of graphs into induced forests

On acyclic colorings of planar graphs

O. V. Borodin · Discrete Mathematics · 1979 · 265 citations

Natural Sciences, Mathematics, Combinatorics +11

Coloring with no $2$-Colored $P_4$'s

Michael O. Albertson, Glenn G. Chappell, H. A. Kierstead et al. · The Electronic Journal of Combinatorics · 2004 · 142 citations · Full text

Natural Sciences, Mathematics, Color Theory +10

Good and semi-strong colorings of oriented planar graphs

André Raspaud, Éric Sopena · Information Processing Letters · 1994 · 137 citations

Natural Sciences, Mathematics, Color Theory +13

A fast algorithm for equitable coloring

Henry A. Kiersteád, Alexandr Kostochka, Marcelo Mydlarz et al. · COMBINATORICA · 2010 · 88 citations

Computing, Computer Science, Algorithms +7

On the linear vertex‐arboricity of a planar graph

K. S. Poh · Journal of Graph Theory · 1990 · 82 citations

Natural Sciences, Computer Science, Mathematics +6