Follow
H. A. Kierstead
Title
Cited by
Cited by
Year
An extremal problem in recursive combinatorics
HA Kierstead, WT Trotter
Congressus Numerantium 33 (143-153), 98, 1981
2581981
On the game chromatic number of some classes of graphs
U Faigle, W Kern, H Kierstead, WT Trotter
Ars combinatoria 35, 143-150, 1993
2391993
Planar graph coloring with an uncooperative partner
HA Kierstead, WT Trotter
Journal of Graph Theory 18 (6), 569-584, 1994
2131994
Coloring with no -Colored 's
MO Albertson, GG Chappell, HA Kierstead, A Kündgen, R Ramamurthi
the electronic journal of combinatorics, R26-R26, 2004
2042004
Hamiltonian chains in hypergraphs
GY Katona, HA Kierstead
Journal of Graph Theory 30 (3), 205-212, 1999
1901999
The linearity of first-fit coloring of interval graphs
HA Kierstead
SIAM Journal on Discrete Mathematics 1 (4), 526-530, 1988
1521988
A simple competitive graph coloring algorithm
HA Kierstead
Journal of Combinatorial Theory, Series B 78 (1), 57-68, 2000
1402000
A short proof of the Hajnal–Szemerédi theorem on equitable colouring
HA Kierstead, AV Kostochka
Combinatorics, Probability and Computing 17 (2), 265-270, 2008
1332008
Orderings on graphs and game coloring number
HA Kierstead, D Yang
Order 20, 255-264, 2003
1202003
Radius two trees specify χ‐bounded classes
HA Kierstead, SG Penrice
Journal of Graph Theory 18 (2), 119-129, 1994
1181994
An effective version of Dilworth’s theorem
HA Kierstead
Transactions of the American Mathematical Society 268 (1), 63-77, 1981
1151981
The map-coloring game
T Bartnicki, J Grytczuk, HA Kierstead, X Zhu
The American Mathematical Monthly 114 (9), 793-803, 2007
1012007
A fast algorithm for equitable coloring
HA Kierstead, AV Kostochka, M Mydlarz, E Szemerédi
Combinatorica 30 (2), 217-224, 2010
962010
A polynomial time approximation algorithm for dynamic storage allocation
HA Kierstead
Discrete Mathematics 88 (2-3), 231-237, 1991
941991
Coloring interval graphs with First-Fit
HA Kierstead, J Qin
Discrete Mathematics 144 (1-3), 47-57, 1995
931995
Explicit matchings in the middle levels of the Boolean lattice
HA Kierstead, WT Trotter
Order 5 (2), 163-171, 1988
871988
An Ore-type theorem on equitable coloring
HA Kierstead, AV Kostochka
Journal of Combinatorial Theory, Series B 98 (1), 226-234, 2008
852008
On the choosability of complete multipartite graphs with part size three
HA Kierstead
Discrete Mathematics 211 (1-3), 255-259, 2000
712000
Hamiltonian square-paths
G Fan, HA Kierstead
journal of combinatorial theory, Series B 67 (2), 167-182, 1996
661996
On-line coloring and recursive graph theory
HA Kierstead, SG Penrice, WT Trotter
SIAM Journal on Discrete Mathematics 7 (1), 72-89, 1994
661994
The system can't perform the operation now. Try again later.
Articles 1–20