H. A. Kierstead

On the game chromatic number of some classes of graphs

Ulrich Faigle, Walter Kern, H. A. Kierstead et al. · Data Archiving and Networked Services (DANS) · 1991 · 144 citations · Full text

Graph Theory, Algebraic Graph Theory, Topological Graph Theory +8

Planar graph coloring with an uncooperative partner

H. A. Kierstead, W. T. Trotter · Journal of Graph Theory · 1994 · 140 citations

Geometric Graph Theory, Graph Theory, Extremal Graph Theory +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 · 140 citations · Full text

Geometric Graph Theory, Proper Coloring, Graph Theory +9

A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring

H. A. Kierstead, Alexandr Kostochka · Combinatorics Probability Computing · 2007 · 115 citations

Colour Classes, Proper Vertex Colouring, Equitable Colouring +10

The Linearity of First-Fit Coloring of Interval Graphs

H. A. Kierstead · SIAM Journal on Discrete Mathematics · 1988 · 114 citations

Mathematical Programming, Cluster Computing, Engineering +17