Hal A. Kierstead

Publication Activity (10 Years)

Years Active: 1984-2022
Publications (10 Years): 13

Top Topics

Graph Theoretic

Channel Assignment

Top Venues

J. Graph Theory

Publications

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) (2022)
Ahlam Almulhim, Hal A. Kierstead
On the weak 2-coloring number of planar graphs. Discret. Math. 345 (1) (2022)
Ming Han, Hal A. Kierstead, Xuding Zhu
Every planar graph is 1-defective (9, 2)-paintable. Discret. Appl. Math. 294 (2021)
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 (2020)
Hal A. Kierstead, Daqing Yang, Junjun Yi
On coloring numbers of graph powers. Discret. Math. 343 (6) (2020)
Jan van den Heuvel, Hal A. Kierstead
Uniform Orderings for Generalized Coloring Numbers. CoRR (2019)
Jan van den Heuvel, Hal A. Kierstead, Daniel A. Quiroz
Chromatic numbers of exact distance graphs. J. Comb. Theory, Ser. B 134 (2019)
Hal A. Kierstead, Alexandr V. Kostochka, Andrew McConvey
A Sharp Dirac-Erdős Type Bound for Large Graphs. Comb. Probab. Comput. 27 (3) (2018)
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) (2018)
Hal A. Kierstead, Landon Rabern
Extracting List Colorings from Large Independent Sets. J. Graph Theory 86 (3) (2017)
Hal A. Kierstead, Alexandr V. Kostochka, Andrew McConvey
Strengthening Theorems of Dirac and Erdős on Disjoint Cycles. J. Graph Theory 85 (4) (2017)
Hal A. Kierstead, Andrew Salmon, Ran Wang
On the choice number of complete multipartite graphs with part size four. Eur. J. Comb. 58 (2016)
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 (2016)
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)
Hal A. Kierstead, Alexandr V. Kostochka
A refinement of a result of Corrádi and Hajnal. Comb. 35 (4) (2015)
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) (2015)
Hal A. Kierstead, Bernard Lidický
On choosability with separation of planar graphs with lists of different sizes. Discret. Math. 338 (10) (2015)
Penny E. Haxell, Hal A. Kierstead
Edge coloring multigraphs without small dense subsets. Discret. Math. 338 (12) (2015)
Hal A. Kierstead, Karin Rebecca Saoub
Generalized Dynamic Storage Allocation. Discret. Math. Theor. Comput. Sci. 16 (3) (2014)
Andrzej Czygrinow, Hal A. Kierstead, Theodore Molla
On directed versions of the Corrádi-Hajnal corollary. Eur. J. Comb. 42 (2014)
Bartlomiej Bosek, Hal A. Kierstead, Tomasz Krawczyk, Grzegorz Matecki, Matthew E. Smith
An Improved Subexponential Bound for On-line Chain Partitioning. CoRR (2014)
Hal A. Kierstead, Matt Earl Smith
On first-fit coloring of ladder-free posets. Eur. J. Comb. 34 (2) (2013)
Hal A. Kierstead, Alexandr V. Kostochka
Equitable List Coloring of Graphs with Bounded Degree. J. Graph Theory 74 (3) (2013)
Hal A. Kierstead, Bernard Lidický
On choosability with separation of planar graphs with lists of different sizes. CoRR (2013)
Hal A. Kierstead, Chung-Ying Yang, Daqing Yang, Xuding Zhu
Adapted game colouring of graphs. Eur. J. Comb. 33 (4) (2012)
Hal A. Kierstead, Karin Rebecca Saoub
First-Fit coloring of bounded tolerance graphs. Discret. Appl. Math. 159 (7) (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) (2011)
Phong Châu, Louis DeBiasio, Hal A. Kierstead
. Random Struct. Algorithms 39 (4) (2011)
Andrzej Czygrinow, Louis DeBiasio, Hal A. Kierstead
2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees. SIAM J. Discret. Math. 24 (2) (2010)
William Cushing, Hal A. Kierstead
Planar graphs are 1-relaxed, 4-choosable. Eur. J. Comb. 31 (5) (2010)
Hal A. Kierstead, Alexandr V. Kostochka
Efficient Graph Packing via Game Colouring. Comb. Probab. Comput. 18 (5) (2009)
Hal A. Kierstead, André Kündgen, Craig Timmons
Star coloring bipartite planar graphs. J. Graph Theory 60 (1) (2009)
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) (2009)
Hal A. Kierstead, Goran Konjevod
Coloring number and on-line Ramsey theory for graphs and hypergraphs. Comb. 29 (1) (2009)
Hal A. Kierstead, Alexandr V. Kostochka
Ore-type versions of Brooks' theorem. J. Comb. Theory, Ser. B 99 (2) (2009)
Tomasz Bartnicki, Jaroslaw Grytczuk, Hal A. Kierstead
The game of arboricity. Discret. Math. 308 (8) (2008)
Hal A. Kierstead, Alexandr V. Kostochka
A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Colouring. Comb. Probab. Comput. 17 (2) (2008)
Daqing Yang, Hal A. Kierstead
Asymmetric marking games on line graphs. Discret. Math. 308 (9) (2008)
Jaroslaw Grytczuk, Hal A. Kierstead, Pawel Pralat
On-line Ramsey Numbers for Paths and Stars. Discret. Math. Theor. Comput. Sci. 10 (3) (2008)
Hal A. Kierstead, Alexandr V. Kostochka
An Ore-type theorem on equitable coloring. J. Comb. Theory, Ser. B 98 (1) (2008)
Tomasz Bartnicki, Jaroslaw Grytczuk, Hal A. Kierstead, Xuding Zhu
The Map-Coloring Game. Am. Math. Mon. 114 (9) (2007)
Noga Alon, Graham R. Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler
Dominating sets in k-majority tournaments. J. Comb. Theory, Ser. B 96 (3) (2006)
Hal A. Kierstead
Asymmetric graph coloring games. J. Graph Theory 48 (3) (2005)
Hal A. Kierstead, Daqing Yang
Very Asymmetric Marking Games. Order 22 (2) (2005)
Hal A. Kierstead, Yingxian Zhu
Radius Three Trees in Graphs with Large Chromatic Number. SIAM J. Discret. Math. 17 (4) (2004)
Charles Dunn, Hal A. Kierstead
A simple competitive graph coloring algorithm II. J. Comb. Theory, Ser. B 90 (1) (2004)
Charles Dunn, Hal A. Kierstead
The relaxed game chromatic number of outerplanar graphs. J. Graph Theory 46 (1) (2004)
Charles Dunn, Hal A. Kierstead
A simple competitive graph coloring algorithm III. J. Comb. Theory, Ser. B 92 (1) (2004)
Hal A. Kierstead, Daqing Yang
Orderings on Graphs and Game Coloring Number. Order 20 (3) (2003)
Hal A. Kierstead, Zsolt Tuza
Marking Games and the Oriented Game Chromatic Number of Partial k-Trees. Graphs Comb. 19 (1) (2003)
Andrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstead, William T. Trotter
A Note on Graph Pebbling. Graphs Comb. 18 (2) (2002)
Hal A. Kierstead
A Simple Competitive Graph Coloring Algorithm. J. Comb. Theory, Ser. B 78 (1) (2000)
Hal A. Kierstead
Extending partial colorings of graphs. Discret. Math. 219 (1-3) (2000)
Gyula Y. Katona, Hal A. Kierstead
Hamiltonian chains in hypergraphs. J. Graph Theory 30 (3) (1999)
Hal A. Kierstead, Gábor N. Sárközy, Stanley M. Selkow
-ordered Hamiltonian graphs. J. Graph Theory 32 (1) (1999)
Hal A. Kierstead
The dimension of two levels of the Boolean lattice. Discret. Math. 201 (1-3) (1999)
Hal A. Kierstead, Juan Quintana
Square Hamiltonian cycles in graphs with maximal 4-cliques. Discret. Math. 178 (1-3) (1998)
Hal A. Kierstead
Classes of Graphs that Are Not Vertex Ramsey. SIAM J. Discret. Math. 10 (3) (1997)
Hal A. Kierstead, Katalin Kolossa
On-Line Coloring of Perfect Graphs. Comb. 16 (4) (1996)
Hal A. Kierstead
Coloring Graphs On-line. Online Algorithms (1996)
Hal A. Kierstead, Vojtech Rödl
Applications of hypergraph coloring to coloring graphs not inducing certain trees. Discret. Math. 150 (1-3) (1996)
Genghua Fan, Hal A. Kierstead
Partitioning a graph into two square-cycles. J. Graph Theory 23 (3) (1996)
Hal A. Kierstead
On the Order Dimension of 1-Sets versus k-Sets. J. Comb. Theory, Ser. A 73 (2) (1996)
Hal A. Kierstead, Jun Qin
Coloring interval graphs with first-fit. Discret. Math. 144 (1-3) (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) (1994)
Hal A. Kierstead, William T. Trotter
Colorful induced subgraphs. Discret. Math. 101 (1-3) (1992)
Hal A. Kierstead, William T. Trotter
Planar Graph Coloring with an Uncooperative Partner. Planar Graphs (1991)
Hal A. Kierstead
A polynomial time approximation algorithm for dynamic storage allocation. Discret. Math. 88 (2-3) (1991)
Hal A. Kierstead, William T. Trotter
On-line Graph Coloring. On-Line Algorithms (1991)
Dwight Duffus, Hal A. Kierstead, William T. Trotter
Fibres and ordered set coloring. J. Comb. Theory, Ser. A 58 (1) (1991)
Hal A. Kierstead
Applications of edge coloring of multigraphs to vertex coloring of graphs. Discret. Math. 74 (1-2) (1989)
Hal A. Kierstead
The Linearity of First-Fit Coloring of Interval Graphs. SIAM J. Discret. Math. 1 (4) (1988)
Hal A. Kierstead, William T. Trotter
A Ramsey theoretic problem for finite ordered sets. Discret. Math. 63 (2-3) (1987)
Andrzej Ehrenfeucht, Vance Faber, Hal A. Kierstead
A new method of proving theorems on chromatic index. Discret. Math. 52 (2-3) (1984)