Henry A. Kierstead

30 papers Journal 30
YearRankTypeTitle / Venue / Authors
2023 J jnl
Improved upper bounds on longest-path and maximal-subdivision transversals.
Discret. Math.
Henry A. Kierstead, Eric Ren
2023 J jnl
Special issue in honour of Landon Rabern.
Discret. Math.
Brian Rabern, Daniel W. Cranston, Henry A. Kierstead
2023 J jnl
The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree.
Discret. Math.
Ilkyoo Choi, Henry A. Kierstead, Landon Rabern
2021 J jnl
Uniform orderings for generalized coloring numbers.
Eur. J. Comb.
Jan van den Heuvel, Henry A. Kierstead
2017 J jnl
On the Corrádi-Hajnal theorem and a question of Dirac.
J. Comb. Theory B
Henry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager
2017 J jnl
The (2k-1)-connected multigraphs with at most k-1 disjoint cycles.
Comb.
Henry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager
2012 J jnl
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring.
J. Graph Theory
Henry A. Kierstead, Alexandr V. Kostochka
2010 J jnl
A fast algorithm for equitable coloring.
Comb.
Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi
2010 J jnl
Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture.
Comb.
Henry A. Kierstead, Alexandr V. Kostochka
2006 J jnl
Weak acyclic coloring and asymmetric coloring games.
Discret. Math.
Henry A. Kierstead
2004 J jnl
Coloring with no 2-Colored P
Electron. J. Comb.
Michael O. Albertson, Glenn G. Chappell, Henry A. Kierstead, André Kündgen, Radhika Ramamurthi
2004 J jnl
Explicit 2-Factorisations of the Odd Graph.
Order
J. Robert Johnson, Henry A. Kierstead
2004 J jnl
On-line Ramsey Theory.
Electron. J. Comb.
Jaroslaw Grytczuk, Mariusz Haluszczak, Henry A. Kierstead
2002 J jnl
2-factors in dense bipartite graphs.
Discret. Math.
Andrzej Czygrinow, Henry A. Kierstead
2001 J jnl
Competitive Colorings of Oriented Graphs.
Electron. J. Comb.
Henry A. Kierstead, William T. Trotter
2001 J jnl
Spanning Trees of Bounded Degree.
Electron. J. Comb.
Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter
2000 J jnl
Interval orders and dimension.
Discret. Math.
Henry A. Kierstead, William T. Trotter
2000 J jnl
On the choosability of complete multipartite graphs with part size three.
Discret. Math.
Henry A. Kierstead
1996 J jnl
Hamiltonian Square-Paths.
J. Comb. Theory B
Genghua Fan, Henry A. Kierstead
1995 J jnl
On-Line and First-Fit Coloring of Graphs That Do Not Induce P
SIAM J. Discret. Math.
Henry A. Kierstead, Stephen G. Penrice, William T. Trotter
1995 J jnl
The Square of Paths and Cycles.
J. Comb. Theory B
Genghua Fan, Henry A. Kierstead
1994 J jnl
On-Line Coloring and Recursive Graph Theory.
SIAM J. Discret. Math.
Henry A. Kierstead, Stephen G. Penrice, William T. Trotter
1994 J jnl
Radius two trees specify χ-bounded classes.
J. Graph Theory
Henry A. Kierstead, Stephen G. Penrice
1991 J jnl
The Dimension of Random Ordered Sets.
Random Struct. Algorithms
Paul Erdös, Henry A. Kierstead, William T. Trotter
1987 J jnl
On pi
J. Symb. Log.
Henry A. Kierstead
1986 J jnl
The chromatic number of graphs which induce neither K
Discret. Math.
Henry A. Kierstead, James H. Schmerl
1984 J jnl
On coloring graphs with locally small chromatic number.
Comb.
Henry A. Kierstead, Endre Szemerédi, William T. Trotter
1984 J jnl
On the chromatic index of multigraphs without large triangles.
J. Comb. Theory B
Henry A. Kierstead
1983 J jnl
Indiscernibles and Decidable Models.
J. Symb. Log.
Henry A. Kierstead, Jeffrey B. Remmel
1983 J jnl
Some applications of Vizing's theorem to vertex colorings of graphs.
Discret. Math.
Henry A. Kierstead, James H. Schmerl