Hal A. Kierstead
Henry A. Kierstead
Arizona State University, Tempe, Arizona, USA
http://math.la.asu.edu/~halk/
https://orcid.org/0000-0002-3685-3262
Henry A. Kierstead
Eric R. Ren
Improved upper bounds on longest-path and maximal-subdivision transversals.
113514
2023
September
346
Discret. Math.
9
https://doi.org/10.1016/j.disc.2023.113514
db/journals/dm/dm346.html#KiersteadR23
Ilkyoo Choi
Henry A. Kierstead
Landon Rabern
The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree.
113300
2023
November
346
Discret. Math.
11
https://doi.org/10.1016/j.disc.2022.113300
db/journals/dm/dm346.html#ChoiKR23
Brian Rabern
Daniel W. Cranston
Henry A. Kierstead
Special issue in honour of Landon Rabern.
113507
2023
November
346
Discret. Math.
11
https://doi.org/10.1016/j.disc.2023.113507
db/journals/dm/dm346.html#RabernCK23
Ahlam Almulhim
Hal A. Kierstead
On the weak 2-coloring number of planar graphs.
112631
2022
345
Discret. Math.
1
https://doi.org/10.1016/j.disc.2021.112631
db/journals/dm/dm345.html#AlmulhimK22
Yangyan Gu
Hal A. Kierstead
Sang-il Oum
Hao Qi 0001
Xuding Zhu
3-Degenerate induced subgraph of a planar graph.
251-277
2022
99
J. Graph Theory
2
https://doi.org/10.1002/jgt.22740
db/journals/jgt/jgt99.html#GuKOQZ22
Ming Han
Hal A. Kierstead
Xuding Zhu
Every planar graph is 1-defective (9, 2)-paintable.
257-264
2021
294
Discret. Appl. Math.
https://doi.org/10.1016/j.dam.2021.02.008
db/journals/dam/dam294.html#HanKZ21
Jan van den Heuvel
Henry A. Kierstead
Uniform orderings for generalized coloring numbers.
103214
2021
91
Eur. J. Comb.
https://doi.org/10.1016/j.ejc.2020.103214
db/journals/ejc/ejc91.html#HeuvelK21
Hal A. Kierstead
Daqing Yang
Junjun Yi
On coloring numbers of graph powers.
111712
2020
343
Discret. Math.
6
https://doi.org/10.1016/j.disc.2019.111712
db/journals/dm/dm343.html#KiersteadYY20
Hal A. Kierstead
Landon Rabern
Improved lower bounds on the number of edges in list critical and online list critical graphs.
147-170
2020
140
J. Comb. Theory, Ser. B
https://doi.org/10.1016/j.jctb.2019.05.004
db/journals/jct/jctb140.html#KiersteadR20
Jan van den Heuvel
Hal A. Kierstead
Daniel A. Quiroz
Chromatic numbers of exact distance graphs.
143-163
2019
134
J. Comb. Theory, Ser. B
https://doi.org/10.1016/j.jctb.2018.05.007
db/journals/jct/jctb134.html#HeuvelKQ19
Jan van den Heuvel
Hal A. Kierstead
Uniform Orderings for Generalized Coloring Numbers.
2019
abs/1907.12149
CoRR
http://arxiv.org/abs/1907.12149
db/journals/corr/corr1907.html#abs-1907-12149
Bartlomiej Bosek
Hal A. Kierstead
Tomasz Krawczyk
Grzegorz Matecki
Matthew E. Smith 0001
An Easy Subexponential Bound for Online Chain Partitioning.
2
2018
25
Electron. J. Comb.
2
https://doi.org/10.37236/7231
db/journals/combinatorics/combinatorics25.html#BosekKKMS18
Hal A. Kierstead
Alexandr V. Kostochka
Andrew McConvey
A Sharp Dirac-Erdős Type Bound for Large Graphs.
387-397
2018
27
Comb. Probab. Comput.
3
https://doi.org/10.1017/S0963548318000020
db/journals/cpc/cpc27.html#KiersteadKM18
Henry A. Kierstead
Alexandr V. Kostochka
Elyse Yeager
The (2k-1)-connected multigraphs with at most k-1 disjoint cycles.
77-86
2017
37
Comb.
1
https://doi.org/10.1007/s00493-015-3291-8
db/journals/combinatorica/combinatorica37.html#KiersteadKY17
Henry A. Kierstead
Alexandr V. Kostochka
Elyse Yeager
On the Corrádi-Hajnal theorem and a question of Dirac.
121-148
2017
122
J. Comb. Theory, Ser. B
https://doi.org/10.1016/j.jctb.2016.05.007
db/journals/jct/jctb122.html#KiersteadKY17
Hal A. Kierstead
Alexandr V. Kostochka
Andrew McConvey
Strengthening Theorems of Dirac and Erdős on Disjoint Cycles.
788-802
2017
85
J. Graph Theory
4
https://doi.org/10.1002/jgt.22106
db/journals/jgt/jgt85.html#KiersteadKM17
Hal A. Kierstead
Landon Rabern
Extracting List Colorings from Large Independent Sets.
315-328
2017
86
J. Graph Theory
3
https://doi.org/10.1002/jgt.22128
db/journals/jgt/jgt86.html#KiersteadR17
Hal A. Kierstead
David A. Smith
William T. Trotter
First-fit coloring on interval graphs has performance ratio at least 5.
236-254
2016
51
Eur. J. Comb.
https://doi.org/10.1016/j.ejc.2015.05.015
db/journals/ejc/ejc51.html#KiersteadST16
Hal A. Kierstead
Andrew Salmon
Ran Wang
On the choice number of complete multipartite graphs with part size four.
1-16
2016
58
Eur. J. Comb.
https://doi.org/10.1016/j.ejc.2016.05.001
db/journals/ejc/ejc58.html#KiersteadSW16
Hal A. Kierstead
Alexandr V. Kostochka
A refinement of a result of Corrádi and Hajnal.
497-512
2015
35
Comb.
4
https://doi.org/10.1007/s00493-014-3059-6
db/journals/combinatorica/combinatorica35.html#KiersteadK15
Andrzej Czygrinow
Louis DeBiasio
Hal A. Kierstead
Theodore Molla
An Extension of the Hajnal-Szemerédi Theorem to Directed Graphs.
754-773
2015
24
Comb. Probab. Comput.
5
https://doi.org/10.1017/S0963548314000716
db/journals/cpc/cpc24.html#CzygrinowDKM15
Hal A. Kierstead
Bernard Lidický
On choosability with separation of planar graphs with lists of different sizes.
1779-1783
2015
338
Discret. Math.
10
https://doi.org/10.1016/j.disc.2015.01.008
db/journals/dm/dm338.html#KiersteadL15
Penny E. Haxell
Hal A. Kierstead
Edge coloring multigraphs without small dense subsets.
2502-2506
2015
338
Discret. Math.
12
https://doi.org/10.1016/j.disc.2015.06.022
db/journals/dm/dm338.html#HaxellK15
Ran Wang
Chenyang Zhou
Anisha Mazumder
Arun Das 0002
Hal A. Kierstead
Arunabha Sen
Upper and lower bounds of Choice Number for successful channel assignment in cellular networks.
3370-3375
2015
ICC
https://doi.org/10.1109/ICC.2015.7248845
conf/icc/2015
db/conf/icc/icc2015.html#WangZMDKS15
Hal A. Kierstead
Karin Rebecca Saoub
Generalized Dynamic Storage Allocation.
253-262
2014
16
Discret. Math. Theor. Comput. Sci.
3
https://doi.org/10.46298/dmtcs.2083
db/journals/dmtcs/dmtcs16.html#KiersteadS14
Andrzej Czygrinow
Hal A. Kierstead
Theodore Molla
On directed versions of the Corrádi-Hajnal corollary.
1-14
2014
42
Eur. J. Comb.
https://doi.org/10.1016/j.ejc.2014.05.006
db/journals/ejc/ejc42.html#CzygrinowKM14
Bartlomiej Bosek
Hal A. Kierstead
Tomasz Krawczyk
Grzegorz Matecki
Matthew E. Smith 0001
An Improved Subexponential Bound for On-line Chain Partitioning.
2014
abs/1410.3247
CoRR
http://arxiv.org/abs/1410.3247
db/journals/corr/corr1410.html#BosekKKMS14
Hal A. Kierstead
Matt Earl Smith
On first-fit coloring of ladder-free posets.
474-489
2013
34
Eur. J. Comb.
2
https://doi.org/10.1016/j.ejc.2012.07.007
db/journals/ejc/ejc34.html#KiersteadS13
Hal A. Kierstead
Alexandr V. Kostochka
Equitable List Coloring of Graphs with Bounded Degree.
309-334
2013
74
J. Graph Theory
3
https://doi.org/10.1002/jgt.21710
db/journals/jgt/jgt74.html#KiersteadK13
Hal A. Kierstead
Bernard Lidický
On choosability with separation of planar graphs with lists of different sizes.
2013
CoRR
http://arxiv.org/abs/1306.5283
abs/1306.5283
db/journals/corr/corr1306.html#KiersteadL13
Hal A. Kierstead
Chung-Ying Yang
Daqing Yang
Xuding Zhu
Adapted game colouring of graphs.
435-445
2012
33
Eur. J. Comb.
4
https://doi.org/10.1016/j.ejc.2011.11.001
db/journals/ejc/ejc33.html#KiersteadYYZ12
Henry A. Kierstead
Alexandr V. Kostochka
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring.
31-48
2012
71
J. Graph Theory
1
https://doi.org/10.1002/jgt.20630
db/journals/jgt/jgt71.html#KiersteadK12
Hal A. Kierstead
Karin Rebecca Saoub
First-Fit coloring of bounded tolerance graphs.
605-611
2011
159
Discret. Appl. Math.
7
https://doi.org/10.1016/j.dam.2010.05.002
db/journals/dam/dam159.html#KiersteadS11
Hao Fan
Hal A. Kierstead
Guizhen Liu
Theodore Molla
Jianliang Wu
Xin Zhang 0017
A note on relaxed equitable coloring of graphs.
1062-1066
2011
111
Inf. Process. Lett.
21-22
https://doi.org/10.1016/j.ipl.2011.08.001
db/journals/ipl/ipl111.html#FanKLMWZ11
Phong Châu
Louis DeBiasio
Hal A. Kierstead
Pósa's conjecture for graphs of order at least 2 × 108.
507-525
2011
39
Random Struct. Algorithms
4
https://doi.org/10.1002/rsa.20376
db/journals/rsa/rsa39.html#ChauDK11
Henry A. Kierstead
Alexandr V. Kostochka
Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture.
201-216
2010
30
Comb.
2
https://doi.org/10.1007/s00493-010-2420-7
db/journals/combinatorica/combinatorica30.html#KiersteadK10
Henry A. Kierstead
Alexandr V. Kostochka
Marcelo Mydlarz
Endre Szemerédi
A fast algorithm for equitable coloring.
217-224
2010
30
Comb.
2
https://doi.org/10.1007/s00493-010-2483-5
https://www.wikidata.org/entity/Q60060509
db/journals/combinatorica/combinatorica30.html#KiersteadKMS10
William Cushing
Hal A. Kierstead
Planar graphs are 1-relaxed, 4-choosable.
1385-1397
2010
31
Eur. J. Comb.
5
https://doi.org/10.1016/j.ejc.2009.11.013
db/journals/ejc/ejc31.html#CushingK10
Andrzej Czygrinow
Louis DeBiasio
Hal A. Kierstead
2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees.
486-504
2010
24
SIAM J. Discret. Math.
2
https://doi.org/10.1137/080739513
db/journals/siamdm/siamdm24.html#CzygrinowDK10
Hal A. Kierstead
Goran Konjevod
Coloring number and on-line Ramsey theory for graphs and hypergraphs.
49-64
2009
29
Comb.
1
https://doi.org/10.1007/s00493-009-2264-1
db/journals/combinatorica/combinatorica29.html#KiersteadK09
Hal A. Kierstead
Alexandr V. Kostochka
Efficient Graph Packing via Game Colouring.
765-774
2009
18
Comb. Probab. Comput.
5
https://doi.org/10.1017/S0963548309009973
db/journals/cpc/cpc18.html#KiersteadK09
Hal A. Kierstead
Alexandr V. Kostochka
Ore-type versions of Brooks' theorem.
298-305
2009
99
J. Comb. Theory, Ser. B
2
https://doi.org/10.1016/j.jctb.2008.06.007
db/journals/jct/jctb99.html#KiersteadK09
Hal A. Kierstead
André Kündgen
Craig Timmons
Star coloring bipartite planar graphs.
1-10
2009
60
J. Graph Theory
1
https://doi.org/10.1002/jgt.20342
db/journals/jgt/jgt60.html#KiersteadKT09
Hal A. Kierstead
Bojan Mohar
Simon Spacapan
Daqing Yang
Xuding Zhu
The Two-Coloring Number and Degenerate Colorings of Planar Graphs.
1548-1560
2009
23
SIAM J. Discret. Math.
3
https://doi.org/10.1137/070703697
db/journals/siamdm/siamdm23.html#KiersteadMSYZ09
Hal A. Kierstead
Alexandr V. Kostochka
A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Colouring.
265-270
2008
17
Comb. Probab. Comput.
2
https://doi.org/10.1017/S0963548307008619
https://www.wikidata.org/entity/Q60060517
db/journals/cpc/cpc17.html#KiersteadK08
Tomasz Bartnicki
Jaroslaw Grytczuk
Hal A. Kierstead
The game of arboricity.
1388-1393
2008
308
Discret. Math.
8
https://doi.org/10.1016/j.disc.2007.07.066
db/journals/dm/dm308.html#BartnickiGK08
Daqing Yang
Hal A. Kierstead
Asymmetric marking games on line graphs.
1751-1755
2008
308
Discret. Math.
9
https://doi.org/10.1016/j.disc.2007.03.082
db/journals/dm/dm308.html#YangK08
Jaroslaw Grytczuk
Hal A. Kierstead
Pawel Pralat
On-line Ramsey Numbers for Paths and Stars.
2008
10
Discret. Math. Theor. Comput. Sci.
3
https://doi.org/10.46298/dmtcs.427
db/journals/dmtcs/dmtcs10.html#GrytczukKP08
Hal A. Kierstead
Alexandr V. Kostochka
An Ore-type theorem on equitable coloring.
226-234
2008
98
J. Comb. Theory, Ser. B
1
https://doi.org/10.1016/j.jctb.2007.07.003
db/journals/jct/jctb98.html#KiersteadK08
Tomasz Bartnicki
Jaroslaw Grytczuk
Hal A. Kierstead
Xuding Zhu
The Map-Coloring Game.
793-803
2007
114
Am. Math. Mon.
9
http://www.jstor.org/stable/27642332
db/journals/tamm/tamm114.html#BartnickiGKZ07
Henry A. Kierstead
Weak acyclic coloring and asymmetric coloring games.
673-677
2006
306
Discret. Math.
7
https://doi.org/10.1016/j.disc.2004.07.042
db/journals/dm/dm306.html#Kierstead06
Noga Alon
Graham R. Brightwell
Hal A. Kierstead
Alexandr V. Kostochka
Peter Winkler 0001
Dominating sets in k-majority tournaments.
374-387
2006
96
J. Comb. Theory, Ser. B
3
https://doi.org/10.1016/j.jctb.2005.09.003
db/journals/jct/jctb96.html#AlonBKKW06
Hal A. Kierstead
Asymmetric graph coloring games.
169-185
2005
48
J. Graph Theory
3
https://doi.org/10.1002/jgt.20049
db/journals/jgt/jgt48.html#Kierstead05
Hal A. Kierstead
Daqing Yang
Very Asymmetric Marking Games.
93-107
2005
22
Order
2
https://doi.org/10.1007/s11083-005-9012-y
db/journals/order/order22.html#KiersteadY05
Michael O. Albertson
Glenn G. Chappell
Henry A. Kierstead
André Kündgen
Radhika Ramamurthi
Coloring with no 2-Colored P4's.
2004
11
Electron. J. Comb.
1
https://doi.org/10.37236/1779
db/journals/combinatorics/combinatorics11.html#AlbertsonCKKR04
Jaroslaw Grytczuk
Mariusz Haluszczak
Henry A. Kierstead
On-line Ramsey Theory.
2004
11
Electron. J. Comb.
1
https://doi.org/10.37236/1810
db/journals/combinatorics/combinatorics11.html#GrytczukHK04
Charles L. Dunn
Hal A. Kierstead
A simple competitive graph coloring algorithm II.
93-106
2004
90
J. Comb. Theory, Ser. B
1
https://doi.org/10.1016/S0095-8956(03)00077-7
db/journals/jct/jctb90.html#DunnK04a
Charles L. Dunn
Hal A. Kierstead
A simple competitive graph coloring algorithm III.
137-150
2004
92
J. Comb. Theory, Ser. B
1
https://doi.org/10.1016/j.jctb.2004.03.010
db/journals/jct/jctb92.html#DunnK04
Charles L. Dunn
Hal A. Kierstead
The relaxed game chromatic number of outerplanar graphs.
69-78
2004
46
J. Graph Theory
1
https://doi.org/10.1002/jgt.10172
db/journals/jgt/jgt46.html#DunnK04
J. Robert Johnson
Henry A. Kierstead
Explicit 2-Factorisations of the Odd Graph.
19-27
2004
21
Order
1
https://doi.org/10.1007/s11083-004-3344-x
https://www.wikidata.org/entity/Q47647672
db/journals/order/order21.html#JohnsonK04
Hal A. Kierstead
Yingxian Zhu
Radius Three Trees in Graphs with Large Chromatic Number.
571-581
2004
17
SIAM J. Discret. Math.
4
https://doi.org/10.1137/S0895480198339869
db/journals/siamdm/siamdm17.html#KiersteadZ04
Hal A. Kierstead
Zsolt Tuza
Marking Games and the Oriented Game Chromatic Number of Partial k-Trees.
121-129
2003
19
Graphs Comb.
1
https://doi.org/10.1007/s00373-002-0489-5
db/journals/gc/gc19.html#KiersteadT03
Hal A. Kierstead
Daqing Yang
Orderings on Graphs and Game Coloring Number.
255-264
2003
20
Order
3
https://doi.org/10.1023/B:ORDE.0000026489.93166.cb
db/journals/order/order20.html#KiersteadY03
Andrzej Czygrinow
Henry A. Kierstead
2-factors in dense bipartite graphs.
357-369
2002
257
Discret. Math.
2-3
https://doi.org/10.1016/S0012-365X(02)00435-1
db/journals/dm/dm257.html#CzygrinowK02
Andrzej Czygrinow
Glenn Hurlbert
Hal A. Kierstead
William T. Trotter
A Note on Graph Pebbling.
219-225
2002
18
Graphs Comb.
2
https://doi.org/10.1007/s003730200015
db/journals/gc/gc18.html#CzygrinowHKT02
Andrzej Czygrinow
Genghua Fan
Glenn Hurlbert
Henry A. Kierstead
William T. Trotter
Spanning Trees of Bounded Degree.
2001
8
Electron. J. Comb.
1
https://doi.org/10.37236/1577
db/journals/combinatorics/combinatorics8.html#CzygrinowFHKT01
Henry A. Kierstead
William T. Trotter
Competitive Colorings of Oriented Graphs.
2001
8
Electron. J. Comb.
2
https://doi.org/10.37236/1611
db/journals/combinatorics/combinatorics8.html#KiersteadT01
Henry A. Kierstead
On the choosability of complete multipartite graphs with part size three.
255-259
2000
211
Discret. Math.
https://doi.org/10.1016/S0012-365X(99)00157-0
db/journals/dm/dm211.html#Kierstead00a
Henry A. Kierstead
William T. Trotter
Interval orders and dimension.
179-188
2000
213
Discret. Math.
1-3
https://doi.org/10.1016/S0012-365X(99)00178-8
db/journals/dm/dm213.html#KiersteadT00
Hal A. Kierstead
Extending partial colorings of graphs.
145-152
2000
219
Discret. Math.
1-3
https://doi.org/10.1016/S0012-365X(99)00372-6
db/journals/dm/dm219.html#Kierstead00
Hal A. Kierstead
A Simple Competitive Graph Coloring Algorithm.
57-68
2000
78
J. Comb. Theory, Ser. B
1
https://doi.org/10.1006/jctb.1999.1927
db/journals/jct/jctb78.html#Kierstead00
Hal A. Kierstead
The dimension of two levels of the Boolean lattice.
141-155
1999
201
Discret. Math.
1-3
https://doi.org/10.1016/S0012-365X(98)00316-1
db/journals/dm/dm201.html#Kierstead99
Gyula Y. Katona
Hal A. Kierstead
Hamiltonian chains in hypergraphs.
205-212
1999
30
J. Graph Theory
3
https://doi.org/10.1002/(SICI)1097-0118(199903)30:3<205::AID-JGT5>3.0.CO;2-O
db/journals/jgt/jgt30.html#KatonaK99
Hal A. Kierstead
Gábor N. Sárközy
Stanley M. Selkow
On k-ordered Hamiltonian graphs.
17-25
1999
32
J. Graph Theory
1
https://doi.org/10.1002/(SICI)1097-0118(199909)32:1<17::AID-JGT2>3.0.CO;2-G
db/journals/jgt/jgt32.html#KiersteadSS99
Hal A. Kierstead
Juan Quintana
Square Hamiltonian cycles in graphs with maximal 4-cliques.
81-92
1998
178
Discret. Math.
1-3
https://doi.org/10.1016/S0012-365X(97)81819-5
db/journals/dm/dm178.html#KiersteadQ98
Hal A. Kierstead
Classes of Graphs that Are Not Vertex Ramsey.
373-380
1997
10
SIAM J. Discret. Math.
3
https://doi.org/10.1137/S0895480194264769
db/journals/siamdm/siamdm10.html#Kierstead97
Hal A. Kierstead
Katalin Kolossa
On-Line Coloring of Perfect Graphs.
479-491
1996
16
Comb.
4
db/journals/combinatorica/combinatorica16.html#KiersteadK96
https://doi.org/10.1007/BF01271267
Hal A. Kierstead
Vojtech Rödl
Applications of hypergraph coloring to coloring graphs not inducing certain trees.
187-193
1996
150
Discret. Math.
1-3
https://doi.org/10.1016/0012-365X(95)00187-2
db/journals/dm/dm150.html#KiersteadR96
Genghua Fan
Henry A. Kierstead
Hamiltonian Square-Paths.
167-182
1996
67
J. Comb. Theory, Ser. B
2
https://doi.org/10.1006/jctb.1996.0039
db/journals/jct/jctb67.html#FanK96
Hal A. Kierstead
On the Order Dimension of 1-Sets versus k-Sets.
219-228
1996
73
J. Comb. Theory, Ser. A
2
https://doi.org/10.1006/jcta.1996.0019
db/journals/jct/jcta73.html#Kierstead96
Genghua Fan
Hal A. Kierstead
Partitioning a graph into two square-cycles.
241-256
1996
23
J. Graph Theory
3
https://doi.org/10.1002/(SICI)1097-0118(199611)23:3<241::AID-JGT4>3.0.CO;2-S
db/journals/jgt/jgt23.html#FanK96
Hal A. Kierstead
Coloring Graphs On-line.
281-305
1996
conf/dagstuhl/1996oa
Online Algorithms
db/conf/dagstuhl/oa96.html#Kierstead96
https://doi.org/10.1007/BFb0029574
Hal A. Kierstead
Jun Qin
Coloring interval graphs with first-fit.
47-57
1995
144
Discret. Math.
1-3
https://doi.org/10.1016/0012-365X(94)00285-Q
db/journals/dm/dm144.html#KiersteadQ95
Genghua Fan
Henry A. Kierstead
The Square of Paths and Cycles.
55-64
1995
63
J. Comb. Theory, Ser. B
1
https://doi.org/10.1006/jctb.1995.1005
db/journals/jct/jctb63.html#FanK95
Henry A. Kierstead
Stephen G. Penrice
William T. Trotter
On-Line and First-Fit Coloring of Graphs That Do Not Induce P5.
485-498
1995
8
SIAM J. Discret. Math.
4
https://doi.org/10.1137/S0895480191218861
db/journals/siamdm/siamdm8.html#KiersteadPT95
D. A. Duffus
Hal A. Kierstead
Hunter S. Snevily
An Explicit 1-Factorization in the Middle of the Boolean Lattice.
334-342
1994
65
J. Comb. Theory, Ser. A
2
db/journals/jct/jcta65.html#DuffusKS94
Henry A. Kierstead
Stephen G. Penrice
Radius two trees specify χ-bounded classes.
119-129
1994
18
J. Graph Theory
2
https://doi.org/10.1002/jgt.3190180203
db/journals/jgt/jgt18.html#KiersteadP94
Henry A. Kierstead
Stephen G. Penrice
William T. Trotter
On-Line Coloring and Recursive Graph Theory.
72-89
1994
7
SIAM J. Discret. Math.
1
https://doi.org/10.1137/S0895480192224737
db/journals/siamdm/siamdm7.html#KiersteadPT94
Hal A. Kierstead
William T. Trotter
Colorful induced subgraphs.
165-169
1992
101
Discret. Math.
1-3
https://doi.org/10.1016/0012-365X(92)90600-K
db/journals/dm/dm101.html#KiersteadT92
Hal A. Kierstead
A polynomial time approximation algorithm for dynamic storage allocation.
231-237
1991
88
Discret. Math.
2-3
https://doi.org/10.1016/0012-365X(91)90011-P
db/journals/dm/dm88.html#Kierstead91
Dwight Duffus
Hal A. Kierstead
William T. Trotter
Fibres and ordered set coloring.
158-164
1991
58
J. Comb. Theory, Ser. A
1
https://doi.org/10.1016/0097-3165(91)90083-S
db/journals/jct/jcta58.html#DuffusKT91
Paul Erdös
Henry A. Kierstead
William T. Trotter
The Dimension of Random Ordered Sets.
254-276
1991
2
Random Struct. Algorithms
3
db/journals/rsa/rsa2.html#ErdosKT91
https://doi.org/10.1002/rsa.3240020302
https://www.wikidata.org/entity/Q105687844
Hal A. Kierstead
William T. Trotter
On-line Graph Coloring.
85-92
1991
On-Line Algorithms
conf/dimacs/dimacs7
db/conf/dimacs/dimacs7.html#KiersteadT91
https://doi.org/10.1090/dimacs/007/06
Hal A. Kierstead
William T. Trotter
Planar Graph Coloring with an Uncooperative Partner.
85-93
1991
Planar Graphs
conf/dimacs/dimacs9
db/conf/dimacs/dimacs9.html#KiersteadT91a
https://doi.org/10.1090/dimacs/009/08
Hal A. Kierstead
Applications of edge coloring of multigraphs to vertex coloring of graphs.
117-124
1989
74
Discret. Math.
1-2
https://doi.org/10.1016/0012-365X(89)90203-3
db/journals/dm/dm74.html#Kierstead89
Hal A. Kierstead
The Linearity of First-Fit Coloring of Interval Graphs.
526-530
1988
1
SIAM J. Discret. Math.
4
db/journals/siamdm/siamdm1.html#Kierstead88
https://doi.org/10.1137/0401048
Hal A. Kierstead
William T. Trotter
A Ramsey theoretic problem for finite ordered sets.
217-223
1987
63
Discret. Math.
2-3
https://doi.org/10.1016/0012-365X(87)90009-4
db/journals/dm/dm63.html#KiersteadT87
Henry A. Kierstead
On pi1-Automorphism of Recursive Linear Orders.
681-688
1987
52
J. Symb. Log.
3
db/journals/jsyml/jsyml52.html#Kierstead87
https://doi.org/10.1017/S0022481200029686
http://projecteuclid.org/euclid.jsl/1183742435
Henry A. Kierstead
James H. Schmerl
The chromatic number of graphs which induce neither K1, 3 nor K5-e.
253-262
1986
58
Discret. Math.
3
https://doi.org/10.1016/0012-365X(86)90142-1
db/journals/dm/dm58.html#KiersteadS86
Henry A. Kierstead
Endre Szemerédi
William T. Trotter
On coloring graphs with locally small chromatic number.
183-185
1984
4
Comb.
2
db/journals/combinatorica/combinatorica4.html#KiersteadST84
https://doi.org/10.1007/BF02579219
Andrzej Ehrenfeucht
Vance Faber
Hal A. Kierstead
A new method of proving theorems on chromatic index.
159-164
1984
52
Discret. Math.
2-3
https://doi.org/10.1016/0012-365X(84)90078-5
db/journals/dm/dm52.html#EhrenfeuchtFK84
Henry A. Kierstead
On the chromatic index of multigraphs without large triangles.
156-160
1984
36
J. Comb. Theory, Ser. B
2
https://doi.org/10.1016/0095-8956(84)90022-4
db/journals/jct/jctb36.html#Kierstead84
Henry A. Kierstead
James H. Schmerl
Some applications of Vizing's theorem to vertex colorings of graphs.
277-285
1983
45
Discret. Math.
2-3
https://doi.org/10.1016/0012-365X(83)90043-2
db/journals/dm/dm45.html#KiersteadS83
Henry A. Kierstead
Jeffrey B. Remmel
Indiscernibles and Decidable Models.
21-32
1983
48
J. Symb. Log.
1
db/journals/jsyml/jsyml48.html#KiersteadR83
https://doi.org/10.2307/2273316
http://projecteuclid.org/euclid.jsl/1183741186
Michael O. Albertson
Ahlam Almulhim
Noga Alon
Tomasz Bartnicki
Bartlomiej Bosek
Graham R. Brightwell
Glenn G. Chappell
Phong Châu
Ilkyoo Choi
Daniel W. Cranston
William Cushing
Andrzej Czygrinow
Arun Das 0002
Louis DeBiasio
D. A. Duffus
Dwight Duffus
Charles L. Dunn
Andrzej Ehrenfeucht
Paul Erdös
Vance Faber
Genghua Fan
Hao Fan
Jaroslaw Grytczuk
Yangyan Gu
Mariusz Haluszczak
Ming Han
Penny E. Haxell
Jan van den Heuvel
Glenn H. HurlbertGlenn Hurlbert
J. Robert Johnson
Gyula Y. Katona
Katalin Kolossa
Goran Konjevod
Alexandr V. Kostochka
Tomasz Krawczyk
André Kündgen
Bernard Lidický
Guizhen Liu
Grzegorz Matecki
Anisha Mazumder
Andrew McConvey
Bojan Mohar
Theodore Molla
Marcelo Mydlarz
Sang-il Oum
Stephen G. Penrice
Pawel Pralat
Hao Qi 0001
Jun Qin
Juan Quintana
Daniel Quiroz 0001Daniel A. Quiroz
Brian Rabern
Landon Rabern
Radhika Ramamurthi
Jeffrey B. Remmel
Eric R. Ren
Vojtech Rödl
Andrew Salmon
Karin Rebecca Saoub
Gábor N. Sárközy
James H. Schmerl
Stanley M. Selkow
Arunabha Sen
David A. Smith
Matt Earl SmithMatthew E. Smith 0001
Hunter S. Snevily
Simon Spacapan
Endre Szemerédi
Craig Timmons
William T. Trotter
Zsolt Tuza
Ran Wang
Peter Winkler 0001
Jian-Liang WuJianliang Wu
Chung-Ying Yang
Daqing Yang
Elyse Yeager
Junjun Yi
Xin Zhang 0017
Chenyang Zhou
Xuding Zhu
Yingxian Zhu