Hal A. Kierstead

Hal A. Kierstead, Matt Earl Smith: On first-fit coloring of ladder-free posets. Eur. J. Comb. 34(2): 474-489 (2013)

Hal A. Kierstead, Chung-Ying Yang, Daqing Yang, Xuding Zhu: Adapted game colouring of graphs. Eur. J. Comb. 33(4): 435-445 (2012)

Henry A. Kierstead, Alexandr V. Kostochka: Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring. Journal of Graph Theory 71(1): 31-48 (2012)

Hal A. Kierstead, Karin R. Saoub: First-Fit coloring of bounded tolerance graphs. Discrete Applied Mathematics 159(7): 605-611 (2011)

Hao Fan, Hal A. Kierstead, Guizhen Liu, Theodore Molla, Jianliang Wu, Xin Zhang: A note on relaxed equitable coloring of graphs. Inf. Process. Lett. 111(21-22): 1062-1066 (2011)

Phong Châu, Louis DeBiasio, Hal A. Kierstead: Pósa's conjecture for graphs of order at least 2 × 10⁸. Random Struct. Algorithms 39(4): 507-525 (2011)

Henry A. Kierstead, Alexandr V. Kostochka: Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture. Combinatorica 30(2): 201-216 (2010)

Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi: A fast algorithm for equitable coloring. Combinatorica 30(2): 217-224 (2010)

William Cushing, Hal A. Kierstead: Planar graphs are 1-relaxed, 4-choosable. Eur. J. Comb. 31(5): 1385-1397 (2010)

Andrzej Czygrinow, Louis DeBiasio, Hal A. Kierstead: 2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees. SIAM J. Discrete Math. 24(2): 486-504 (2010)

Hal A. Kierstead, Goran Konjevod: Coloring number and on-line Ramsey theory for graphs and hypergraphs. Combinatorica 29(1): 49-64 (2009)

Hal A. Kierstead, Alexandr V. Kostochka: Efficient Graph Packing via Game Colouring. Combinatorics, Probability & Computing 18(5): 765-774 (2009)

Hal A. Kierstead, Alexandr V. Kostochka: Ore-type versions of Brooks' theorem. J. Comb. Theory, Ser. B 99(2): 298-305 (2009)

Hal A. Kierstead, André Kündgen, Craig Timmons: Star coloring bipartite planar graphs. Journal of Graph Theory 60(1): 1-10 (2009)

Hal A. Kierstead, Bojan Mohar, Simon Spacapan, Daqing Yang, Xuding Zhu: The Two-Coloring Number and Degenerate Colorings of Planar Graphs. SIAM J. Discrete Math. 23(3): 1548-1560 (2009)

Hal A. Kierstead, Alexandr V. Kostochka: A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Colouring. Combinatorics, Probability & Computing 17(2): 265-270 (2008)

Tomasz Bartnicki, Jaroslaw Grytczuk, Hal A. Kierstead: The game of arboricity. Discrete Mathematics 308(8): 1388-1393 (2008)

Daqing Yang, Hal A. Kierstead: Asymmetric marking games on line graphs. Discrete Mathematics 308(9): 1751-1755 (2008)

Jaroslaw Grytczuk, Hal A. Kierstead, Pawel Pralat: On-line Ramsey Numbers for Paths and Stars. Discrete Mathematics & Theoretical Computer Science 10(3) (2008)

Hal A. Kierstead, Alexandr V. Kostochka: An Ore-type theorem on equitable coloring. J. Comb. Theory, Ser. B 98(1): 226-234 (2008)

Tomasz Bartnicki, Jaroslaw Grytczuk, Hal A. Kierstead, Xuding Zhu: The Map-Coloring Game. The American Mathematical Monthly 114(9): 793-803 (2007)

Henry A. Kierstead: Weak acyclic coloring and asymmetric coloring games. Discrete Mathematics 306(7): 673-677 (2006)

Noga Alon, Graham Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler: Dominating sets in k-majority tournaments. J. Comb. Theory, Ser. B 96(3): 374-387 (2006)

Hal A. Kierstead: Asymmetric graph coloring games. Journal of Graph Theory 48(3): 169-185 (2005)

Hal A. Kierstead, Daqing Yang: Very Asymmetric Marking Games. Order 22(2): 93-107 (2005)

Michael O. Albertson, Glenn G. Chappell, Henry A. Kierstead, André Kündgen, Radhika Ramamurthi: Coloring with no 2-Colored P₄'s. Electr. J. Comb. 11(1) (2004)

Jaroslaw Grytczuk, Mariusz Haluszczak, Henry A. Kierstead: On-line Ramsey Theory. Electr. J. Comb. 11(1) (2004)

Charles Dunn, Hal A. Kierstead: A simple competitive graph coloring algorithm II. J. Comb. Theory, Ser. B 90(1): 93-106 (2004)

Charles Dunn, Hal A. Kierstead: A simple competitive graph coloring algorithm III. J. Comb. Theory, Ser. B 92(1): 137-150 (2004)

Charles Dunn, Hal A. Kierstead: The relaxed game chromatic number of outerplanar graphs. Journal of Graph Theory 46(1): 69-78 (2004)

J. Robert Johnson, Henry A. Kierstead: Explicit 2-Factorisations of the Odd Graph. Order 21(1): 19-27 (2004)

Hal A. Kierstead, Yingxian Zhu: Radius Three Trees in Graphs with Large Chromatic Number. SIAM J. Discrete Math. 17(4): 571-581 (2004)

Hal A. Kierstead, Zsolt Tuza: Marking Games and the Oriented Game Chromatic Number of Partial k-Trees. Graphs and Combinatorics 19(1): 121-129 (2003)

Hal A. Kierstead, Daqing Yang: Orderings on Graphs and Game Coloring Number. Order 20(3): 255-264 (2003)

Andrzej Czygrinow, Henry A. Kierstead: 2-factors in dense bipartite graphs. Discrete Mathematics 257(2-3): 357-369 (2002)

Andrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstead, William T. Trotter: A Note on Graph Pebbling. Graphs and Combinatorics 18(2): 219-225 (2002)

Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter: Spanning Trees of Bounded Degree. Electr. J. Comb. 8(1) (2001)

Henry A. Kierstead, William T. Trotter: Competitive Colorings of Oriented Graphs. Electr. J. Comb. 8(2) (2001)

Henry A. Kierstead: On the choosability of complete multipartite graphs with part size three. Discrete Mathematics 211: 255-259 (2000)

Henry A. Kierstead, William T. Trotter: Interval orders and dimension. Discrete Mathematics 213(1-3): 179-188 (2000)

Hal A. Kierstead: Extending partial colorings of graphs. Discrete Mathematics 219(1-3): 145-152 (2000)

Hal A. Kierstead: A Simple Competitive Graph Coloring Algorithm. J. Comb. Theory, Ser. B 78(1): 57-68 (2000)

Hal A. Kierstead: The dimension of two levels of the Boolean lattice. Discrete Mathematics 201(1-3): 141-155 (1999)

Hal A. Kierstead, Gábor N. Sárközy, Stanley M. Selkow: On k-ordered Hamiltonian graphs. Journal of Graph Theory 32(1): 17-25 (1999)

Hal A. Kierstead, Juan Quintana: Square Hamiltonian cycles in graphs with maximal 4-cliques. Discrete Mathematics 178(1-3): 81-92 (1998)

Hal A. Kierstead: Classes of Graphs that Are Not Vertex Ramsey. SIAM J. Discrete Math. 10(3): 373-380 (1997)

Hal A. Kierstead, Katalin Kolossa: On-Line Coloring of Perfect Graphs. Combinatorica 16(4): 479-491 (1996)

Hal A. Kierstead, Vojtech Rödl: Applications of hypergraph coloring to coloring graphs not inducing certain trees. Discrete Mathematics 150(1-3): 187-193 (1996)

Genghua Fan, Henry A. Kierstead: Hamiltonian Square-Paths. J. Comb. Theory, Ser. B 67(2): 167-182 (1996)

Hal A. Kierstead: On the Order Dimension of 1-Sets versus k-Sets. J. Comb. Theory, Ser. A 73(2): 219-228 (1996)

Genghua Fan, Hal A. Kierstead: Partitioning a graph into two square-cycles. Journal of Graph Theory 23(3): 241-256 (1996)

Hal A. Kierstead: Coloring Graphs On-line. Online Algorithms 1996: 281-305

Hal A. Kierstead, Jun Qin: Coloring interval graphs with first-fit. Discrete Mathematics 144(1-3): 47-57 (1995)

Genghua Fan, Henry A. Kierstead: The Square of Paths and Cycles. J. Comb. Theory, Ser. B 63(1): 55-64 (1995)

Henry A. Kierstead, Stephen G. Penrice, William T. Trotter: On-Line and First-Fit Coloring of Graphs That Do Not Induce P₅. SIAM J. Discrete Math. 8(4): 485-498 (1995)

D. A. Duffus, Hal A. Kierstead, Hunter S. Snevily: An Explicit 1-Factorization in the Middle of the Boolean Lattice. J. Comb. Theory, Ser. A 65(2): 334-342 (1994)

Henry A. Kierstead, Stephen G. Penrice: Radius two trees specify χ-bounded classes. Journal of Graph Theory 18(2): 119-129 (1994)

Henry A. Kierstead, Stephen G. Penrice, William T. Trotter: On-Line Coloring and Recursive Graph Theory. SIAM J. Discrete Math. 7(1): 72-89 (1994)

Hal A. Kierstead, William T. Trotter: Colorful induced subgraphs. Discrete Mathematics 101(1-3): 165-169 (1992)

Hal A. Kierstead: A polynomial time approximation algorithm for dynamic storage allocation. Discrete Mathematics 88(2-3): 231-237 (1991)

Dwight Duffus, Hal A. Kierstead, William T. Trotter: Fibres and ordered set coloring. J. Comb. Theory, Ser. A 58(1): 158-164 (1991)

Paul Erdös, Henry A. Kierstead, William T. Trotter: The Dimension of Random Ordered Sets. Random Struct. Algorithms 2(3): 254-276 (1991)

Hal A. Kierstead: Applications of edge coloring of multigraphs to vertex coloring of graphs. Discrete Mathematics 74(1-2): 117-124 (1989)

Hal A. Kierstead: The Linearity of First-Fit Coloring of Interval Graphs. SIAM J. Discrete Math. 1(4): 526-530 (1988)

Hal A. Kierstead, William T. Trotter: A Ramsey theoretic problem for finite ordered sets. Discrete Mathematics 63(2-3): 217-223 (1987)

Henry A. Kierstead: On pi₁-Automorphism of Recursive Linear Orders. J. Symb. Log. 52(3): 681-688 (1987)

Henry A. Kierstead, James H. Schmerl: The chromatic number of graphs which induce neither K_{1, 3} nor K₅-e. Discrete Mathematics 58(3): 253-262 (1986)

Henry A. Kierstead, Endre Szemerédi, William T. Trotter: On coloring graphs with locally small chromatic number. Combinatorica 4(2): 183-185 (1984)

Andrzej Ehrenfeucht, V. Faber, Hal A. Kierstead: A new method of proving theorems on chromatic index. Discrete Mathematics 52(2-3): 159-164 (1984)

Henry A. Kierstead: On the chromatic index of multigraphs without large triangles. J. Comb. Theory, Ser. B 36(2): 156-160 (1984)

Henry A. Kierstead, James H. Schmerl: Some applications of Vizing's theorem to vertex colorings of graphs. Discrete Mathematics 45(2-3): 277-285 (1983)

Henry A. Kierstead, Jeffrey B. Remmel: Indiscernibles and Decidable Models. J. Symb. Log. 48(1): 21-32 (1983)