Henry A. Kierstead

Publication Activity (10 Years)

Years Active: 1983-2023
Publications (10 Years): 5

Top Topics

Digital Topology

Top Venues

J. Comb. Theory, Ser. B

Publications

Ilkyoo Choi, Henry A. Kierstead, Landon Rabern
The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree. Discret. Math. 346 (11) (2023)
Brian Rabern, Daniel W. Cranston, Henry A. Kierstead
Special issue in honour of Landon Rabern. Discret. Math. 346 (11) (2023)
Jan van den Heuvel, Henry A. Kierstead
Uniform orderings for generalized coloring numbers. Eur. J. Comb. 91 (2021)
Henry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager
The (2k-1)-connected multigraphs with at most k-1 disjoint cycles. Comb. 37 (1) (2017)
Henry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager
On the Corrádi-Hajnal theorem and a question of Dirac. J. Comb. Theory, Ser. B 122 (2017)
Henry A. Kierstead, Alexandr V. Kostochka
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring. J. Graph Theory 71 (1) (2012)
Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi
A fast algorithm for equitable coloring. Comb. 30 (2) (2010)
Henry A. Kierstead, Alexandr V. Kostochka
Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture. Comb. 30 (2) (2010)
Henry A. Kierstead
Weak acyclic coloring and asymmetric coloring games. Discret. Math. 306 (7) (2006)
J. Robert Johnson, Henry A. Kierstead
Explicit 2-Factorisations of the Odd Graph. Order 21 (1) (2004)
Michael O. Albertson, Glenn G. Chappell, Henry A. Kierstead, André Kündgen, Radhika Ramamurthi
's. Electron. J. Comb. 11 (1) (2004)
Jaroslaw Grytczuk, Mariusz Haluszczak, Henry A. Kierstead
On-line Ramsey Theory. Electron. J. Comb. 11 (1) (2004)
Andrzej Czygrinow, Henry A. Kierstead
2-factors in dense bipartite graphs. Discret. Math. 257 (2-3) (2002)
Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter
Spanning Trees of Bounded Degree. Electron. J. Comb. 8 (1) (2001)
Henry A. Kierstead, William T. Trotter
Competitive Colorings of Oriented Graphs. Electron. J. Comb. 8 (2) (2001)
Henry A. Kierstead
On the choosability of complete multipartite graphs with part size three. Discret. Math. 211 (2000)
Henry A. Kierstead, William T. Trotter
Interval orders and dimension. Discret. Math. 213 (1-3) (2000)
Genghua Fan, Henry A. Kierstead
Hamiltonian Square-Paths. J. Comb. Theory, Ser. B 67 (2) (1996)
Henry A. Kierstead, Stephen G. Penrice, William T. Trotter
. SIAM J. Discret. Math. 8 (4) (1995)
Genghua Fan, Henry A. Kierstead
The Square of Paths and Cycles. J. Comb. Theory, Ser. B 63 (1) (1995)
Henry A. Kierstead, Stephen G. Penrice, William T. Trotter
On-Line Coloring and Recursive Graph Theory. SIAM J. Discret. Math. 7 (1) (1994)
Henry A. Kierstead, Stephen G. Penrice
Radius two trees specify χ-bounded classes. J. Graph Theory 18 (2) (1994)
Paul Erdös, Henry A. Kierstead, William T. Trotter
The Dimension of Random Ordered Sets. Random Struct. Algorithms 2 (3) (1991)
Henry A. Kierstead
-Automorphism of Recursive Linear Orders. J. Symb. Log. 52 (3) (1987)
Henry A. Kierstead, James H. Schmerl
-e. Discret. Math. 58 (3) (1986)
Henry A. Kierstead
On the chromatic index of multigraphs without large triangles. J. Comb. Theory, Ser. B 36 (2) (1984)
Henry A. Kierstead, Endre Szemerédi, William T. Trotter
On coloring graphs with locally small chromatic number. Comb. 4 (2) (1984)
Henry A. Kierstead, James H. Schmerl
Some applications of Vizing's theorem to vertex colorings of graphs. Discret. Math. 45 (2-3) (1983)
Henry A. Kierstead, Jeffrey B. Remmel
Indiscernibles and Decidable Models. J. Symb. Log. 48 (1) (1983)