Hal A. Kierstead

Henry A. Kierstead

	2009
55		Hal A. Kierstead, Alexandr V. Kostochka: Ore-type versions of Brooks' theorem. J. Comb. Theory, Ser. B 99(2): 298-305 (2009)
54		Hal A. Kierstead, André Kündgen, Craig Timmons: Star coloring bipartite planar graphs. Journal of Graph Theory 60(1): 1-10 (2009)
	2008
53		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)
52		Tomasz Bartnicki, Jaroslaw Grytczuk, Hal A. Kierstead: The game of arboricity. Discrete Mathematics 308(8): 1388-1393 (2008)
51		Daqing Yang, Hal A. Kierstead: Asymmetric marking games on line graphs. Discrete Mathematics 308(9): 1751-1755 (2008)
50		Jaroslaw Grytczuk, Hal A. Kierstead, Pawel Pralat: On-line Ramsey Numbers for Paths and Stars. Discrete Mathematics & Theoretical Computer Science 10(3): (2008)
49		Hal A. Kierstead, Alexandr V. Kostochka: An Ore-type theorem on equitable coloring. J. Comb. Theory, Ser. B 98(1): 226-234 (2008)
	2006
48		Henry A. Kierstead: Weak acyclic coloring and asymmetric coloring games. Discrete Mathematics 306(7): 673-677 (2006)
47		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)
	2005
46		Hal A. Kierstead: Asymmetric graph coloring games. Journal of Graph Theory 48(3): 169-185 (2005)
45		Hal A. Kierstead, Daqing Yang: Very Asymmetric Marking Games. Order 22(2): 93-107 (2005)
	2004
44		Michael O. Albertson, Glenn G. Chappell, Henry A. Kierstead, André Kündgen, Radhika Ramamurthi: Coloring with no 2-Colored P4's. Electr. J. Comb. 11(1): (2004)
43		Jaroslaw Grytczuk, Mariusz Haluszczak, Henry A. Kierstead: On-line Ramsey Theory. Electr. J. Comb. 11(1): (2004)
42		Charles Dunn, Hal A. Kierstead: A simple competitive graph coloring algorithm II. J. Comb. Theory, Ser. B 90(1): 93-106 (2004)
41		Charles Dunn, Hal A. Kierstead: A simple competitive graph coloring algorithm III. J. Comb. Theory, Ser. B 92(1): 137-150 (2004)
40		Charles Dunn, Hal A. Kierstead: The relaxed game chromatic number of outerplanar graphs. Journal of Graph Theory 46(1): 69-78 (2004)
39		J. Robert Johnson, Henry A. Kierstead: Explicit 2-Factorisations of the Odd Graph. Order 21(1): 19-27 (2004)
38		Hal A. Kierstead, Yingxian Zhu: Radius Three Trees in Graphs with Large Chromatic Number. SIAM J. Discrete Math. 17(4): 571-581 (2004)
	2003
37		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)
36		Hal A. Kierstead, Daqing Yang: Orderings on Graphs and Game Coloring Number. Order 20(3): 255-264 (2003)
	2002
35		Andrzej Czygrinow, Henry A. Kierstead: 2-factors in dense bipartite graphs. Discrete Mathematics 257(2-3): 357-369 (2002)
34		Andrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstead, William T. Trotter: A Note on Graph Pebbling. Graphs and Combinatorics 18(2): 219-225 (2002)
	2001
33		Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter: Spanning Trees of Bounded Degree. Electr. J. Comb. 8(1): (2001)
32		Henry A. Kierstead, William T. Trotter: Competitive Colorings of Oriented Graphs. Electr. J. Comb. 8(2): (2001)
	2000
31		Henry A. Kierstead: On the choosability of complete multipartite graphs with part size three. Discrete Mathematics 211: 255-259 (2000)
30		Henry A. Kierstead, William T. Trotter: Interval orders and dimension. Discrete Mathematics 213(1-3): 179-188 (2000)
29		Hal A. Kierstead: Extending partial colorings of graphs. Discrete Mathematics 219(1-3): 145-152 (2000)
28		Hal A. Kierstead: A Simple Competitive Graph Coloring Algorithm. J. Comb. Theory, Ser. B 78(1): 57-68 (2000)
	1999
27		Hal A. Kierstead: The dimension of two levels of the Boolean lattice. Discrete Mathematics 201(1-3): 141-155 (1999)
	1998
26		Hal A. Kierstead, Juan Quintana: Square Hamiltonian cycles in graphs with maximal 4-cliques. Discrete Mathematics 178(1-3): 81-92 (1998)
	1997
25		Hal A. Kierstead: Classes of Graphs that Are Not Vertex Ramsey. SIAM J. Discrete Math. 10(3): 373-380 (1997)
	1996
24		Hal A. Kierstead: Coloring Graphs On-line. Online Algorithms 1996: 281-305
23		Hal A. Kierstead, Katalin Kolossa: On-Line Coloring of Perfect Graphs. Combinatorica 16(4): 479-491 (1996)
22		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)
21		Hal A. Kierstead: On the Order Dimension of 1-Sets versus k-Sets. J. Comb. Theory, Ser. A 73(2): 219-228 (1996)
20		Genghua Fan, Henry A. Kierstead: Hamiltonian Square-Paths. J. Comb. Theory, Ser. B 67(2): 167-182 (1996)
	1995
19		Hal A. Kierstead, Jun Qin: Coloring interval graphs with first-fit. Discrete Mathematics 144(1-3): 47-57 (1995)
18		Genghua Fan, Henry A. Kierstead: The Square of Paths and Cycles. J. Comb. Theory, Ser. B 63(1): 55-64 (1995)
17		Henry A. Kierstead, Stephen G. Penrice, William T. Trotter: On-Line and First-Fit Coloring of Graphs That Do Not Induce P5. SIAM J. Discrete Math. 8(4): 485-498 (1995)
	1994
16		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)
15		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)
	1992
14		Hal A. Kierstead, William T. Trotter: Colorful induced subgraphs. Discrete Mathematics 101(1-3): 165-169 (1992)
	1991
13		Hal A. Kierstead: A polynomial time approximation algorithm for dynamic storage allocation. Discrete Mathematics 88(2-3): 231-237 (1991)
12		Dwight Duffus, Hal A. Kierstead, William T. Trotter: Fibres and ordered set coloring. J. Comb. Theory, Ser. A 58(1): 158-164 (1991)
11		Paul Erdös, Henry A. Kierstead, William T. Trotter: The Dimension of Random Ordered Sets. Random Struct. Algorithms 2(3): 254-276 (1991)
	1989
10		Hal A. Kierstead: Applications of edge coloring of multigraphs to vertex coloring of graphs. Discrete Mathematics 74(1-2): 117-124 (1989)
	1988
9		Hal A. Kierstead: The Linearity of First-Fit Coloring of Interval Graphs. SIAM J. Discrete Math. 1(4): 526-530 (1988)
	1987
8		Hal A. Kierstead, William T. Trotter: A Ramsey theoretic problem for finite ordered sets. Discrete Mathematics 63(2-3): 217-223 (1987)
7		Henry A. Kierstead: On pi1-Automorphism of Recursive Linear Orders. J. Symb. Log. 52(3): 681-688 (1987)
	1986
6		Henry A. Kierstead, James H. Schmerl: The chromatic number of graphs which induce neither K1, 3 nor K5-e. Discrete Mathematics 58(3): 253-262 (1986)
	1984
5		Henry A. Kierstead, Endre Szemerédi, William T. Trotter: On coloring graphs with locally small chromatic number. Combinatorica 4(2): 183-185 (1984)
4		Andrzej Ehrenfeucht, V. Faber, Hal A. Kierstead: A new method of proving theorems on chromatic index. Discrete Mathematics 52(2-3): 159-164 (1984)
3		Henry A. Kierstead: On the chromatic index of multigraphs without large triangles. J. Comb. Theory, Ser. B 36(2): 156-160 (1984)
	1983
2		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)
1		Henry A. Kierstead, Jeffrey B. Remmel: Indiscernibles and Decidable Models. J. Symb. Log. 48(1): 21-32 (1983)

Coauthor Index

1	Michael O. Albertson	[44]
2	Noga Alon	[47]
3	Tomasz Bartnicki	[52]
4	Graham Brightwell	[47]
5	Glenn G. Chappell	[44]
6	Andrzej Czygrinow	[33] [34] [35]
7	D. A. Duffus	[16]
8	Dwight Duffus	[12]
9	Charles Dunn	[40] [41] [42]
10	Andrzej Ehrenfeucht	[4]
11	Paul Erdös	[11]
12	V. Faber	[4]
13	Genghua Fan	[18] [20] [33]
14	Jaroslaw Grytczuk	[43] [50] [52]
15	Mariusz Haluszczak	[43]
16	Glenn H. Hurlbert (Glenn Hurlbert)	[33] [34]
17	J. Robert Johnson	[39]
18	Katalin Kolossa	[23]
19	Alexandr V. Kostochka	[47] [49] [53] [55]
20	André Kündgen	[44] [54]
21	Stephen G. Penrice	[15] [17]
22	Pawel Pralat	[50]
23	Jun Qin	[19]
24	Juan Quintana	[26]
25	Radhika Ramamurthi	[44]
26	Jeffrey B. Remmel	[1]
27	Vojtech Rödl	[22]
28	James H. Schmerl	[2] [6]
29	Hunter S. Snevily	[16]
30	Endre Szemerédi	[5]
31	Craig Timmons	[54]
32	William T. Trotter	[5] [8] [11] [12] [14] [15] [17] [30] [32] [33] [34]
33	Zsolt Tuza	[37]
34	Peter Winkler (Peter M. Winkler)	[47]
35	Daqing Yang	[36] [45] [51]
36	Yingxian Zhu	[38]

Colors in the list of coauthors