Hal A. Kierstead

76 papers Journal 72Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Equitable list coloring of sparse graphs.
Discret. Math.
Hal A. Kierstead, Alexandr V. Kostochka, Zimu Xiang
2025 J jnl
Equitable List Coloring of Planar Graphs With Given Maximum Degree.
J. Graph Theory
Hal A. Kierstead, Alexandr V. Kostochka, Zimu Xiang
2022 J jnl
3-Degenerate induced subgraph of a planar graph.
J. Graph Theory
Yangyan Gu, Hal A. Kierstead, Sang-il Oum, Hao Qi, Xuding Zhu
2022 J jnl
On the weak 2-coloring number of planar graphs.
Discret. Math.
Ahlam Almulhim, Hal A. Kierstead
2021 J jnl
Every planar graph is 1-defective (9, 2)-paintable.
Discret. Appl. Math.
Ming Han, Hal A. Kierstead, Xuding Zhu
2020 J jnl
Improved lower bounds on the number of edges in list critical and online list critical graphs.
J. Comb. Theory, Ser. B
Hal A. Kierstead, Landon Rabern
2020 J jnl
On coloring numbers of graph powers.
Discret. Math.
Hal A. Kierstead, Daqing Yang, Junjun Yi
2019 J jnl
Chromatic numbers of exact distance graphs.
J. Comb. Theory B
Jan van den Heuvel, Hal A. Kierstead, Daniel A. Quiroz
2019 J jnl
Uniform Orderings for Generalized Coloring Numbers.
CoRR
Jan van den Heuvel, Hal A. Kierstead
2018 J jnl
A Sharp Dirac-Erdős Type Bound for Large Graphs.
Comb. Probab. Comput.
Hal A. Kierstead, Alexandr V. Kostochka, Andrew McConvey
2018 J jnl
An Easy Subexponential Bound for Online Chain Partitioning.
Electron. J. Comb.
Bartlomiej Bosek, Hal A. Kierstead, Tomasz Krawczyk, Grzegorz Matecki, Matthew E. Smith
2017 J jnl
Extracting List Colorings from Large Independent Sets.
J. Graph Theory
Hal A. Kierstead, Landon Rabern
2017 J jnl
Strengthening Theorems of Dirac and Erdős on Disjoint Cycles.
J. Graph Theory
Hal A. Kierstead, Alexandr V. Kostochka, Andrew McConvey
2016 J jnl
First-fit coloring on interval graphs has performance ratio at least 5.
Eur. J. Comb.
Hal A. Kierstead, David A. Smith, William T. Trotter
2016 J jnl
On the choice number of complete multipartite graphs with part size four.
Eur. J. Comb.
Hal A. Kierstead, Andrew Salmon, Ran Wang
2015 J jnl
A refinement of a result of Corrádi and Hajnal.
Comb.
Hal A. Kierstead, Alexandr V. Kostochka
2015 J jnl
An Extension of the Hajnal-Szemerédi Theorem to Directed Graphs.
Comb. Probab. Comput.
Andrzej Czygrinow, Louis DeBiasio, Hal A. Kierstead, Theodore Molla
2015 J jnl
Edge coloring multigraphs without small dense subsets.
Discret. Math.
Penny E. Haxell, Hal A. Kierstead
2015 J jnl
On choosability with separation of planar graphs with lists of different sizes.
Discret. Math.
Hal A. Kierstead, Bernard Lidický
2015 — conf
Upper and lower bounds of Choice Number for successful channel assignment in cellular networks.
ICC
Ran Wang, Chenyang Zhou, Anisha Mazumder, Arun Das, Hal A. Kierstead, Arunabha Sen
2014 J jnl
An Improved Subexponential Bound for On-line Chain Partitioning.
CoRR
Bartlomiej Bosek, Hal A. Kierstead, Tomasz Krawczyk, Grzegorz Matecki, Matthew E. Smith
2014 J jnl
Generalized Dynamic Storage Allocation.
Discret. Math. Theor. Comput. Sci.
Hal A. Kierstead, Karin Rebecca Saoub
2014 J jnl
On directed versions of the Corrádi-Hajnal corollary.
Eur. J. Comb.
Andrzej Czygrinow, Hal A. Kierstead, Theodore Molla
2013 J jnl
Equitable List Coloring of Graphs with Bounded Degree.
J. Graph Theory
Hal A. Kierstead, Alexandr V. Kostochka
2013 J jnl
On choosability with separation of planar graphs with lists of different sizes.
CoRR
Hal A. Kierstead, Bernard Lidický
2013 J jnl
On first-fit coloring of ladder-free posets.
Eur. J. Comb.
Hal A. Kierstead, Matt Earl Smith
2012 J jnl
Adapted game colouring of graphs.
Eur. J. Comb.
Hal A. Kierstead, Chung-Ying Yang, Daqing Yang, Xuding Zhu
2011 J jnl
A note on relaxed equitable coloring of graphs.
Inf. Process. Lett.
Hao Fan, Hal A. Kierstead, Guizhen Liu, Theodore Molla, Jianliang Wu, Xin Zhang
2011 J jnl
First-Fit coloring of bounded tolerance graphs.
Discret. Appl. Math.
Hal A. Kierstead, Karin Rebecca Saoub
2011 J jnl
Pósa's conjecture for graphs of order at least 2 × 10
Random Struct. Algorithms
Phong Châu, Louis DeBiasio, Hal A. Kierstead
2010 J jnl
2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees.
SIAM J. Discret. Math.
Andrzej Czygrinow, Louis DeBiasio, Hal A. Kierstead
2010 J jnl
Planar graphs are 1-relaxed, 4-choosable.
Eur. J. Comb.
William Cushing, Hal A. Kierstead
2009 J jnl
Coloring number and on-line Ramsey theory for graphs and hypergraphs.
Comb.
Hal A. Kierstead, Goran Konjevod
2009 J jnl
Efficient Graph Packing via Game Colouring.
Comb. Probab. Comput.
Hal A. Kierstead, Alexandr V. Kostochka
2009 J jnl
Ore-type versions of Brooks' theorem.
J. Comb. Theory B
Hal A. Kierstead, Alexandr V. Kostochka
2009 J jnl
Star coloring bipartite planar graphs.
J. Graph Theory
Hal A. Kierstead, André Kündgen, Craig Timmons
2009 J jnl
The Two-Coloring Number and Degenerate Colorings of Planar Graphs.
SIAM J. Discret. Math.
Hal A. Kierstead, Bojan Mohar, Simon Spacapan, Daqing Yang, Xuding Zhu
2008 J jnl
A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Colouring.
Comb. Probab. Comput.
Hal A. Kierstead, Alexandr V. Kostochka
2008 J jnl
An Ore-type theorem on equitable coloring.
J. Comb. Theory B
Hal A. Kierstead, Alexandr V. Kostochka
2008 J jnl
Asymmetric marking games on line graphs.
Discret. Math.
Daqing Yang, Hal A. Kierstead
2008 J jnl
On-line Ramsey Numbers for Paths and Stars.
Discret. Math. Theor. Comput. Sci.
Jaroslaw Grytczuk, Hal A. Kierstead, Pawel Pralat
2008 J jnl
The game of arboricity.
Discret. Math.
Tomasz Bartnicki, Jaroslaw Grytczuk, Hal A. Kierstead
2007 J jnl
The Map-Coloring Game.
Am. Math. Mon.
Tomasz Bartnicki, Jaroslaw Grytczuk, Hal A. Kierstead, Xuding Zhu
2006 J jnl
Dominating sets in k-majority tournaments.
J. Comb. Theory B
Noga Alon, Graham R. Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler
2005 J jnl
Asymmetric graph coloring games.
J. Graph Theory
Hal A. Kierstead
2005 J jnl
Very Asymmetric Marking Games.
Order
Hal A. Kierstead, Daqing Yang
2004 J jnl
A simple competitive graph coloring algorithm II.
J. Comb. Theory B
Charles L. Dunn, Hal A. Kierstead
2004 J jnl
A simple competitive graph coloring algorithm III.
J. Comb. Theory B
Charles L. Dunn, Hal A. Kierstead
2004 J jnl
Radius Three Trees in Graphs with Large Chromatic Number.
SIAM J. Discret. Math.
Hal A. Kierstead, Yingxian Zhu
2004 J jnl
The relaxed game chromatic number of outerplanar graphs.
J. Graph Theory
Charles L. Dunn, Hal A. Kierstead
2003 J jnl
Marking Games and the Oriented Game Chromatic Number of Partial k-Trees.
Graphs Comb.
Hal A. Kierstead, Zsolt Tuza
2003 J jnl
Orderings on Graphs and Game Coloring Number.
Order
Hal A. Kierstead, Daqing Yang
2002 J jnl
A Note on Graph Pebbling.
Graphs Comb.
Andrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstead, William T. Trotter
2000 J jnl
A Simple Competitive Graph Coloring Algorithm.
J. Comb. Theory B
Hal A. Kierstead
2000 J jnl
Extending partial colorings of graphs.
Discret. Math.
Hal A. Kierstead
1999 J jnl
Hamiltonian chains in hypergraphs.
J. Graph Theory
Gyula Y. Katona, Hal A. Kierstead
1999 J jnl
On
J. Graph Theory
Hal A. Kierstead, Gábor N. Sárközy, Stanley M. Selkow
1999 J jnl
The dimension of two levels of the Boolean lattice.
Discret. Math.
Hal A. Kierstead
1998 J jnl
Square Hamiltonian cycles in graphs with maximal 4-cliques.
Discret. Math.
Hal A. Kierstead, Juan Quintana
1997 J jnl
Classes of Graphs that Are Not Vertex Ramsey.
SIAM J. Discret. Math.
Hal A. Kierstead
1996 J jnl
Applications of hypergraph coloring to coloring graphs not inducing certain trees.
Discret. Math.
Hal A. Kierstead, Vojtech Rödl
1996 — conf
Coloring Graphs On-line.
Online Algorithms
Hal A. Kierstead
1996 J jnl
On the Order Dimension of 1-Sets versus k-Sets.
J. Comb. Theory A
Hal A. Kierstead
1996 J jnl
On-Line Coloring of Perfect Graphs.
Comb.
Hal A. Kierstead, Katalin Kolossa
1996 J jnl
Partitioning a graph into two square-cycles.
J. Graph Theory
Genghua Fan, Hal A. Kierstead
1995 J jnl
Coloring interval graphs with first-fit.
Discret. Math.
Hal A. Kierstead, Jun Qin
1994 J jnl
An Explicit 1-Factorization in the Middle of the Boolean Lattice.
J. Comb. Theory A
D. A. Duffus, Hal A. Kierstead, Hunter S. Snevily
1992 J jnl
Colorful induced subgraphs.
Discret. Math.
Hal A. Kierstead, William T. Trotter
1991 J jnl
A polynomial time approximation algorithm for dynamic storage allocation.
Discret. Math.
Hal A. Kierstead
1991 J jnl
Fibres and ordered set coloring.
J. Comb. Theory A
Dwight Duffus, Hal A. Kierstead, William T. Trotter
1991 — conf
On-line Graph Coloring.
On-Line Algorithms
Hal A. Kierstead, William T. Trotter
1991 — conf
Planar Graph Coloring with an Uncooperative Partner.
Planar Graphs
Hal A. Kierstead, William T. Trotter
1989 J jnl
Applications of edge coloring of multigraphs to vertex coloring of graphs.
Discret. Math.
Hal A. Kierstead
1988 J jnl
The Linearity of First-Fit Coloring of Interval Graphs.
SIAM J. Discret. Math.
Hal A. Kierstead
1987 J jnl
A Ramsey theoretic problem for finite ordered sets.
Discret. Math.
Hal A. Kierstead, William T. Trotter
1984 J jnl
A new method of proving theorems on chromatic index.
Discret. Math.
Andrzej Ehrenfeucht, Vance Faber, Hal A. Kierstead