default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHal A. Kierstead
Henry A. Kierstead
Person information
- affiliation: Arizona State University, Tempe, Arizona, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2023
[j97]Henry A. Kierstead, Eric R. Ren:
Improved upper bounds on longest-path and maximal-subdivision transversals. Discret. Math. 346(9): 113514 (2023)- [j96]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): 113300 (2023) - [j95]Brian Rabern, Daniel W. Cranston, Henry A. Kierstead:
Special issue in honour of Landon Rabern. Discret. Math. 346(11): 113507 (2023) - 2022
- [j94]Ahlam Almulhim, Hal A. Kierstead:
On the weak 2-coloring number of planar graphs. Discret. Math. 345(1): 112631 (2022) - [j93]Yangyan Gu, Hal A. Kierstead, Sang-il Oum, Hao Qi, Xuding Zhu:
3-Degenerate induced subgraph of a planar graph. J. Graph Theory 99(2): 251-277 (2022) - 2021
- [j92]Ming Han, Hal A. Kierstead, Xuding Zhu:
Every planar graph is 1-defective (9, 2)-paintable. Discret. Appl. Math. 294: 257-264 (2021) - [j91]Jan van den Heuvel, Henry A. Kierstead:
Uniform orderings for generalized coloring numbers. Eur. J. Comb. 91: 103214 (2021) - 2020
- [j90]Hal A. Kierstead, Daqing Yang, Junjun Yi:
On coloring numbers of graph powers. Discret. Math. 343(6): 111712 (2020) - [j89]Hal A. Kierstead, Landon Rabern:
Improved lower bounds on the number of edges in list critical and online list critical graphs. J. Comb. Theory, Ser. B 140: 147-170 (2020) - 2019
- [j88]Jan van den Heuvel, Hal A. Kierstead, Daniel A. Quiroz:
Chromatic numbers of exact distance graphs. J. Comb. Theory B 134: 143-163 (2019) - 2018
- [j87]Bartlomiej Bosek, Hal A. Kierstead, Tomasz Krawczyk, Grzegorz Matecki, Matthew E. Smith:
An Easy Subexponential Bound for Online Chain Partitioning. Electron. J. Comb. 25(2): 2 (2018) - [j86]Hal A. Kierstead, Alexandr V. Kostochka, Andrew McConvey:
A Sharp Dirac-Erdős Type Bound for Large Graphs. Comb. Probab. Comput. 27(3): 387-397 (2018) - 2017
- [j85]Henry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager:
The (2k-1)-connected multigraphs with at most k-1 disjoint cycles. Comb. 37(1): 77-86 (2017) - [j84]Henry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager:
On the Corrádi-Hajnal theorem and a question of Dirac. J. Comb. Theory B 122: 121-148 (2017) - [j83]Hal A. Kierstead, Alexandr V. Kostochka, Andrew McConvey:
Strengthening Theorems of Dirac and Erdős on Disjoint Cycles. J. Graph Theory 85(4): 788-802 (2017) - [j82]Hal A. Kierstead, Landon Rabern:
Extracting List Colorings from Large Independent Sets. J. Graph Theory 86(3): 315-328 (2017) - 2016
- [j81]Hal A. Kierstead, David A. Smith, William T. Trotter:
First-fit coloring on interval graphs has performance ratio at least 5. Eur. J. Comb. 51: 236-254 (2016) - [j80]Hal A. Kierstead, Andrew Salmon, Ran Wang:
On the choice number of complete multipartite graphs with part size four. Eur. J. Comb. 58: 1-16 (2016) - 2015
- [j79]Hal A. Kierstead, Alexandr V. Kostochka:
A refinement of a result of Corrádi and Hajnal. Comb. 35(4): 497-512 (2015) - [j78]Andrzej Czygrinow, Louis DeBiasio, Hal A. Kierstead, Theodore Molla:
An Extension of the Hajnal-Szemerédi Theorem to Directed Graphs. Comb. Probab. Comput. 24(5): 754-773 (2015) - [j77]Hal A. Kierstead, Bernard Lidický:
On choosability with separation of planar graphs with lists of different sizes. Discret. Math. 338(10): 1779-1783 (2015) - [j76]Penny E. Haxell, Hal A. Kierstead:
Edge coloring multigraphs without small dense subsets. Discret. Math. 338(12): 2502-2506 (2015) - 2014
- [j75]Hal A. Kierstead, Karin Rebecca Saoub:
Generalized Dynamic Storage Allocation. Discret. Math. Theor. Comput. Sci. 16(3): 253-262 (2014) - [j74]Andrzej Czygrinow, Hal A. Kierstead, Theodore Molla:
On directed versions of the Corrádi-Hajnal corollary. Eur. J. Comb. 42: 1-14 (2014) - 2013
- [j73]Hal A. Kierstead, Matt Earl Smith:
On first-fit coloring of ladder-free posets. Eur. J. Comb. 34(2): 474-489 (2013) - [j72]Hal A. Kierstead, Alexandr V. Kostochka:
Equitable List Coloring of Graphs with Bounded Degree. J. Graph Theory 74(3): 309-334 (2013) - 2012
- [j71]Hal A. Kierstead, Chung-Ying Yang, Daqing Yang, Xuding Zhu:
Adapted game colouring of graphs. Eur. J. Comb. 33(4): 435-445 (2012) - [j70]Henry A. Kierstead, Alexandr V. Kostochka:
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring. J. Graph Theory 71(1): 31-48 (2012) - 2011
- [j69]Hal A. Kierstead, Karin Rebecca Saoub:
First-Fit coloring of bounded tolerance graphs. Discret. Appl. Math. 159(7): 605-611 (2011) - [j68]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) - [j67]Phong Châu, Louis DeBiasio, Hal A. Kierstead:
Pósa's conjecture for graphs of order at least 2 × 108. Random Struct. Algorithms 39(4): 507-525 (2011) - 2010
- [j66]Henry A. Kierstead, Alexandr V. Kostochka:
Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture. Comb. 30(2): 201-216 (2010) - [j65]Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi:
A fast algorithm for equitable coloring. Comb. 30(2): 217-224 (2010) - [j64]William Cushing, Hal A. Kierstead:
Planar graphs are 1-relaxed, 4-choosable. Eur. J. Comb. 31(5): 1385-1397 (2010) - [j63]Andrzej Czygrinow, Louis DeBiasio, Hal A. Kierstead:
2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees. SIAM J. Discret. Math. 24(2): 486-504 (2010) - 2009
- [j62]Hal A. Kierstead, Goran Konjevod:
Coloring number and on-line Ramsey theory for graphs and hypergraphs. Comb. 29(1): 49-64 (2009) - [j61]Hal A. Kierstead, Alexandr V. Kostochka:
Efficient Graph Packing via Game Colouring. Comb. Probab. Comput. 18(5): 765-774 (2009) - [j60]Hal A. Kierstead, Alexandr V. Kostochka:
Ore-type versions of Brooks' theorem. J. Comb. Theory B 99(2): 298-305 (2009) - [j59]Hal A. Kierstead, André Kündgen, Craig Timmons:
Star coloring bipartite planar graphs. J. Graph Theory 60(1): 1-10 (2009) - [j58]Hal A. Kierstead, Bojan Mohar, Simon Spacapan, Daqing Yang, Xuding Zhu:
The Two-Coloring Number and Degenerate Colorings of Planar Graphs. SIAM J. Discret. Math. 23(3): 1548-1560 (2009) - 2008
- [j57]Hal A. Kierstead, Alexandr V. Kostochka:
A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Colouring. Comb. Probab. Comput. 17(2): 265-270 (2008) - [j56]Tomasz Bartnicki, Jaroslaw Grytczuk, Hal A. Kierstead:
The game of arboricity. Discret. Math. 308(8): 1388-1393 (2008) - [j55]Daqing Yang, Hal A. Kierstead:
Asymmetric marking games on line graphs. Discret. Math. 308(9): 1751-1755 (2008) - [j54]Jaroslaw Grytczuk, Hal A. Kierstead, Pawel Pralat:
On-line Ramsey Numbers for Paths and Stars. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - [j53]Hal A. Kierstead, Alexandr V. Kostochka:
An Ore-type theorem on equitable coloring. J. Comb. Theory B 98(1): 226-234 (2008) - 2007
- [j52]Tomasz Bartnicki, Jaroslaw Grytczuk, Hal A. Kierstead, Xuding Zhu:
The Map-Coloring Game. Am. Math. Mon. 114(9): 793-803 (2007) - 2006
- [j51]Henry A. Kierstead:
Weak acyclic coloring and asymmetric coloring games. Discret. Math. 306(7): 673-677 (2006) - [j50]Noga Alon, Graham R. Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler:
Dominating sets in k-majority tournaments. J. Comb. Theory B 96(3): 374-387 (2006) - 2005
- [j49]Hal A. Kierstead:
Asymmetric graph coloring games. J. Graph Theory 48(3): 169-185 (2005) - [j48]Hal A. Kierstead, Daqing Yang:
Very Asymmetric Marking Games. Order 22(2): 93-107 (2005) - 2004
- [j47]Michael O. Albertson, Glenn G. Chappell, Henry A. Kierstead, André Kündgen, Radhika Ramamurthi:
Coloring with no 2-Colored P4's. Electron. J. Comb. 11(1) (2004) - [j46]Jaroslaw Grytczuk, Mariusz Haluszczak, Henry A. Kierstead:
On-line Ramsey Theory. Electron. J. Comb. 11(1) (2004) - [j45]Charles L. Dunn, Hal A. Kierstead:
A simple competitive graph coloring algorithm II. J. Comb. Theory B 90(1): 93-106 (2004) - [j44]Charles L. Dunn, Hal A. Kierstead:
A simple competitive graph coloring algorithm III. J. Comb. Theory B 92(1): 137-150 (2004) - [j43]Charles L. Dunn, Hal A. Kierstead:
The relaxed game chromatic number of outerplanar graphs. J. Graph Theory 46(1): 69-78 (2004) - [j42]J. Robert Johnson, Henry A. Kierstead:
Explicit 2-Factorisations of the Odd Graph. Order 21(1): 19-27 (2004) - [j41]Hal A. Kierstead, Yingxian Zhu:
Radius Three Trees in Graphs with Large Chromatic Number. SIAM J. Discret. Math. 17(4): 571-581 (2004) - 2003
- [j40]Hal A. Kierstead, Zsolt Tuza:
Marking Games and the Oriented Game Chromatic Number of Partial k-Trees. Graphs Comb. 19(1): 121-129 (2003) - [j39]Hal A. Kierstead, Daqing Yang:
Orderings on Graphs and Game Coloring Number. Order 20(3): 255-264 (2003) - 2002
- [j38]Andrzej Czygrinow, Henry A. Kierstead:
2-factors in dense bipartite graphs. Discret. Math. 257(2-3): 357-369 (2002) - [j37]Andrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstead, William T. Trotter:
A Note on Graph Pebbling. Graphs Comb. 18(2): 219-225 (2002) - 2001
- [j36]Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter:
Spanning Trees of Bounded Degree. Electron. J. Comb. 8(1) (2001) - [j35]Henry A. Kierstead, William T. Trotter:
Competitive Colorings of Oriented Graphs. Electron. J. Comb. 8(2) (2001) - 2000
- [j34]Henry A. Kierstead:
On the choosability of complete multipartite graphs with part size three. Discret. Math. 211: 255-259 (2000) - [j33]Henry A. Kierstead, William T. Trotter:
Interval orders and dimension. Discret. Math. 213(1-3): 179-188 (2000) - [j32]Hal A. Kierstead:
Extending partial colorings of graphs. Discret. Math. 219(1-3): 145-152 (2000) - [j31]Hal A. Kierstead:
A Simple Competitive Graph Coloring Algorithm. J. Comb. Theory B 78(1): 57-68 (2000) - 1999
- [j30]Hal A. Kierstead:
The dimension of two levels of the Boolean lattice. Discret. Math. 201(1-3): 141-155 (1999) - [j29]Gyula Y. Katona, Hal A. Kierstead:
Hamiltonian chains in hypergraphs. J. Graph Theory 30(3): 205-212 (1999) - [j28]Hal A. Kierstead, Gábor N. Sárközy, Stanley M. Selkow:
On k-ordered Hamiltonian graphs. J. Graph Theory 32(1): 17-25 (1999) - 1998
- [j27]Hal A. Kierstead, Juan Quintana:
Square Hamiltonian cycles in graphs with maximal 4-cliques. Discret. Math. 178(1-3): 81-92 (1998) - 1997
- [j26]Hal A. Kierstead:
Classes of Graphs that Are Not Vertex Ramsey. SIAM J. Discret. Math. 10(3): 373-380 (1997) - 1996
- [j25]Hal A. Kierstead, Katalin Kolossa:
On-Line Coloring of Perfect Graphs. Comb. 16(4): 479-491 (1996) - [j24]Hal A. Kierstead, Vojtech Rödl:
Applications of hypergraph coloring to coloring graphs not inducing certain trees. Discret. Math. 150(1-3): 187-193 (1996) - [j23]Genghua Fan, Henry A. Kierstead:
Hamiltonian Square-Paths. J. Comb. Theory B 67(2): 167-182 (1996) - [j22]Hal A. Kierstead:
On the Order Dimension of 1-Sets versus k-Sets. J. Comb. Theory A 73(2): 219-228 (1996) - [j21]Genghua Fan, Hal A. Kierstead:
Partitioning a graph into two square-cycles. J. Graph Theory 23(3): 241-256 (1996) - 1995
- [j20]Hal A. Kierstead, Jun Qin:
Coloring interval graphs with first-fit. Discret. Math. 144(1-3): 47-57 (1995) - [j19]Genghua Fan, Henry A. Kierstead:
The Square of Paths and Cycles. J. Comb. Theory B 63(1): 55-64 (1995) - [j18]Henry A. Kierstead, Stephen G. Penrice, William T. Trotter:
On-Line and First-Fit Coloring of Graphs That Do Not Induce P5. SIAM J. Discret. Math. 8(4): 485-498 (1995) - 1994
- [j17]D. A. Duffus, Hal A. Kierstead, Hunter S. Snevily:
An Explicit 1-Factorization in the Middle of the Boolean Lattice. J. Comb. Theory A 65(2): 334-342 (1994) - [j16]Henry A. Kierstead, Stephen G. Penrice:
Radius two trees specify χ-bounded classes. J. Graph Theory 18(2): 119-129 (1994) - [j15]Henry A. Kierstead, Stephen G. Penrice, William T. Trotter:
On-Line Coloring and Recursive Graph Theory. SIAM J. Discret. Math. 7(1): 72-89 (1994) - 1992
- [j14]Hal A. Kierstead, William T. Trotter:
Colorful induced subgraphs. Discret. Math. 101(1-3): 165-169 (1992) - 1991
- [j13]Hal A. Kierstead:
A polynomial time approximation algorithm for dynamic storage allocation. Discret. Math. 88(2-3): 231-237 (1991) - [j12]Dwight Duffus, Hal A. Kierstead, William T. Trotter:
Fibres and ordered set coloring. J. Comb. Theory A 58(1): 158-164 (1991) - [j11]Paul Erdös, Henry A. Kierstead, William T. Trotter:
The Dimension of Random Ordered Sets. Random Struct. Algorithms 2(3): 254-276 (1991) - 1989
- [j10]Hal A. Kierstead:
Applications of edge coloring of multigraphs to vertex coloring of graphs. Discret. Math. 74(1-2): 117-124 (1989) - 1988
- [j9]Hal A. Kierstead:
The Linearity of First-Fit Coloring of Interval Graphs. SIAM J. Discret. Math. 1(4): 526-530 (1988) - 1987
- [j8]Hal A. Kierstead, William T. Trotter:
A Ramsey theoretic problem for finite ordered sets. Discret. Math. 63(2-3): 217-223 (1987) - [j7]Henry A. Kierstead:
On pi1-Automorphism of Recursive Linear Orders. J. Symb. Log. 52(3): 681-688 (1987) - 1986
- [j6]Henry A. Kierstead, James H. Schmerl:
The chromatic number of graphs which induce neither K1, 3 nor K5-e. Discret. Math. 58(3): 253-262 (1986) - 1984
- [j5]Henry A. Kierstead, Endre Szemerédi, William T. Trotter:
On coloring graphs with locally small chromatic number. Comb. 4(2): 183-185 (1984) - [j4]Andrzej Ehrenfeucht, Vance Faber, Hal A. Kierstead:
A new method of proving theorems on chromatic index. Discret. Math. 52(2-3): 159-164 (1984) - [j3]Henry A. Kierstead:
On the chromatic index of multigraphs without large triangles. J. Comb. Theory B 36(2): 156-160 (1984) - 1983
- [j2]Henry A. Kierstead, James H. Schmerl:
Some applications of Vizing's theorem to vertex colorings of graphs. Discret. Math. 45(2-3): 277-285 (1983) - [j1]Henry A. Kierstead, Jeffrey B. Remmel:
Indiscernibles and Decidable Models. J. Symb. Log. 48(1): 21-32 (1983)
Conference and Workshop Papers
- 2015
- [c4]Ran Wang, Chenyang Zhou, Anisha Mazumder, Arun Das, Hal A. Kierstead, Arunabha Sen:
Upper and lower bounds of Choice Number for successful channel assignment in cellular networks. ICC 2015: 3370-3375 - 1996
- [c3]Hal A. Kierstead:
Coloring Graphs On-line. Online Algorithms 1996: 281-305 - 1991
- [c2]Hal A. Kierstead, William T. Trotter:
On-line Graph Coloring. On-Line Algorithms 1991: 85-92 - [c1]Hal A. Kierstead, William T. Trotter:
Planar Graph Coloring with an Uncooperative Partner. Planar Graphs 1991: 85-93
Informal and Other Publications
- 2019
- [i3]Jan van den Heuvel, Hal A. Kierstead:
Uniform Orderings for Generalized Coloring Numbers. CoRR abs/1907.12149 (2019) - 2014
- [i2]Bartlomiej Bosek, Hal A. Kierstead, Tomasz Krawczyk, Grzegorz Matecki, Matthew E. Smith:
An Improved Subexponential Bound for On-line Chain Partitioning. CoRR abs/1410.3247 (2014) - 2013
- [i1]Hal A. Kierstead, Bernard Lidický:
On choosability with separation of planar graphs with lists of different sizes. CoRR abs/1306.5283 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
