Hal A. Kierstead

According to our database, Hal A. Kierstead authored at least 102 papers between 1983 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of one.

2023

Special issue in honour of Landon Rabern.

Brian Rabern, Daniel W. Cranston, Henry A. Kierstead

Discret. Math., November, 2023

The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree.

Ilkyoo Choi, Henry A. Kierstead, Landon Rabern

Discret. Math., November, 2023

Improved upper bounds on longest-path and maximal-subdivision transversals.

Henry A. Kierstead, Eric R. Ren

Discret. Math., September, 2023

2022

3-Degenerate induced subgraph of a planar graph.

Yangyan Gu, Hal A. Kierstead, Sang-il Oum, Hao Qi, Xuding Zhu

J. Graph Theory, 2022

On the weak 2-coloring number of planar graphs.

Ahlam Almulhim, Hal A. Kierstead

Discret. Math., 2022

2021

Uniform orderings for generalized coloring numbers.

Jan van den Heuvel, Henry A. Kierstead

Eur. J. Comb., 2021

Every planar graph is 1-defective (9, 2)-paintable.

Ming Han, Hal A. Kierstead, Xuding Zhu

Discret. Appl. Math., 2021

2020

Improved lower bounds on the number of edges in list critical and online list critical graphs.

Hal A. Kierstead, Landon Rabern

J. Comb. Theory, Ser. B, 2020

On coloring numbers of graph powers.

Hal A. Kierstead, Daqing Yang, Junjun Yi

Discret. Math., 2020

2019

Chromatic numbers of exact distance graphs.

Jan van den Heuvel, Hal A. Kierstead, Daniel A. Quiroz

J. Comb. Theory B, 2019

2018

A Sharp Dirac-Erdős Type Bound for Large Graphs.

Hal A. Kierstead, Alexandr V. Kostochka, Andrew McConvey

Comb. Probab. Comput., 2018

An Easy Subexponential Bound for Online Chain Partitioning.

Bartlomiej Bosek, Hal A. Kierstead, Tomasz Krawczyk, Grzegorz Matecki, Matthew E. Smith

Electron. J. Comb., 2018

2017

Extracting List Colorings from Large Independent Sets.

Hal A. Kierstead, Landon Rabern

J. Graph Theory, 2017

Strengthening Theorems of Dirac and Erdős on Disjoint Cycles.

Hal A. Kierstead, Alexandr V. Kostochka, Andrew McConvey

J. Graph Theory, 2017

On the Corrádi-Hajnal theorem and a question of Dirac.

Henry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager

J. Comb. Theory B, 2017

The (2k-1)-connected multigraphs with at most k-1 disjoint cycles.

Henry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager

Comb., 2017

2016

On the choice number of complete multipartite graphs with part size four.

Hal A. Kierstead, Andrew Salmon, Ran Wang

Eur. J. Comb., 2016

First-fit coloring on interval graphs has performance ratio at least 5.

Hal A. Kierstead, David A. Smith, William T. Trotter

Eur. J. Comb., 2016

2015

On choosability with separation of planar graphs with lists of different sizes.

Hal A. Kierstead, Bernard Lidický

Discret. Math., 2015

Edge coloring multigraphs without small dense subsets.

Penny E. Haxell, Hal A. Kierstead

Discret. Math., 2015

An Extension of the Hajnal-Szemerédi Theorem to Directed Graphs.

Andrzej Czygrinow, Louis DeBiasio, Hal A. Kierstead, Theodore Molla

Comb. Probab. Comput., 2015

A refinement of a result of Corrádi and Hajnal.

Hal A. Kierstead, Alexandr V. Kostochka

Comb., 2015

Upper and lower bounds of Choice Number for successful channel assignment in cellular networks.

Ran Wang, Chenyang Zhou, Anisha Mazumder, Arun Das, Hal A. Kierstead, Arunabha Sen

Proceedings of the 2015 IEEE International Conference on Communications, 2015

2014

On directed versions of the Corrádi-Hajnal corollary.

Andrzej Czygrinow, Hal A. Kierstead, Theodore Molla

Eur. J. Comb., 2014

Generalized Dynamic Storage Allocation.

Hal A. Kierstead, Karin Rebecca Saoub

Discret. Math. Theor. Comput. Sci., 2014

An Improved Subexponential Bound for On-line Chain Partitioning.

Bartlomiej Bosek, Hal A. Kierstead, Tomasz Krawczyk, Grzegorz Matecki, Matthew E. Smith

CoRR, 2014

2013

Equitable List Coloring of Graphs with Bounded Degree.

Hal A. Kierstead, Alexandr V. Kostochka

J. Graph Theory, 2013

On first-fit coloring of ladder-free posets.

Hal A. Kierstead, Matt Earl Smith

Eur. J. Comb., 2013

2012

Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring.

Henry A. Kierstead, Alexandr V. Kostochka

J. Graph Theory, 2012

Adapted game colouring of graphs.

Hal A. Kierstead, Chung-Ying Yang, Daqing Yang, Xuding Zhu

Eur. J. Comb., 2012

2011

Pósa's conjecture for graphs of order at least 2 × 10⁸.

Phong Châu, Louis DeBiasio, Hal A. Kierstead

Random Struct. Algorithms, 2011

A note on relaxed equitable coloring of graphs.

Hao Fan, Hal A. Kierstead, Guizhen Liu, Theodore Molla, Jianliang Wu, Xin Zhang

Inf. Process. Lett., 2011

First-Fit coloring of bounded tolerance graphs.

Hal A. Kierstead, Karin Rebecca Saoub

Discret. Appl. Math., 2011

2010

2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees.

Andrzej Czygrinow, Louis DeBiasio, Hal A. Kierstead

SIAM J. Discret. Math., 2010

Planar graphs are 1-relaxed, 4-choosable.

William Cushing, Hal A. Kierstead

Eur. J. Comb., 2010

A fast algorithm for equitable coloring.

Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi

Comb., 2010

Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture.

Henry A. Kierstead, Alexandr V. Kostochka

Comb., 2010

2009

The Two-Coloring Number and Degenerate Colorings of Planar Graphs.

Hal A. Kierstead, Bojan Mohar, Simon Spacapan, Daqing Yang, Xuding Zhu

SIAM J. Discret. Math., 2009

Star coloring bipartite planar graphs.

Hal A. Kierstead, André Kündgen, Craig Timmons

J. Graph Theory, 2009

Ore-type versions of Brooks' theorem.

Hal A. Kierstead, Alexandr V. Kostochka

J. Comb. Theory B, 2009

Efficient Graph Packing via Game Colouring.

Hal A. Kierstead, Alexandr V. Kostochka

Comb. Probab. Comput., 2009

Coloring number and on-line Ramsey theory for graphs and hypergraphs.

Hal A. Kierstead, Goran Konjevod

Comb., 2009

2008

An Ore-type theorem on equitable coloring.

Hal A. Kierstead, Alexandr V. Kostochka

J. Comb. Theory B, 2008

On-line Ramsey Numbers for Paths and Stars.

Jaroslaw Grytczuk, Hal A. Kierstead, Pawel Pralat

Discret. Math. Theor. Comput. Sci., 2008

Asymmetric marking games on line graphs.

Daqing Yang, Hal A. Kierstead

Discret. Math., 2008

The game of arboricity.

Tomasz Bartnicki, Jaroslaw Grytczuk, Hal A. Kierstead

Discret. Math., 2008

A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Colouring.

Hal A. Kierstead, Alexandr V. Kostochka

Comb. Probab. Comput., 2008

2007

The Map-Coloring Game.

Tomasz Bartnicki, Jaroslaw Grytczuk, Hal A. Kierstead, Xuding Zhu

Am. Math. Mon., 2007

2006

Dominating sets in k-majority tournaments.

Noga Alon, Graham R. Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler

J. Comb. Theory B, 2006

Weak acyclic coloring and asymmetric coloring games.

Henry A. Kierstead

Discret. Math., 2006

2005

Very Asymmetric Marking Games.

Hal A. Kierstead, Daqing Yang

Order, 2005

Asymmetric graph coloring games.

Hal A. Kierstead

J. Graph Theory, 2005

2004

Radius Three Trees in Graphs with Large Chromatic Number.

Hal A. Kierstead, Yingxian Zhu

SIAM J. Discret. Math., 2004

Explicit 2-Factorisations of the Odd Graph.

J. Robert Johnson, Henry A. Kierstead

Order, 2004

The relaxed game chromatic number of outerplanar graphs.

Charles L. Dunn, Hal A. Kierstead

J. Graph Theory, 2004

A simple competitive graph coloring algorithm II.

Charles L. Dunn, Hal A. Kierstead

J. Comb. Theory B, 2004

A simple competitive graph coloring algorithm III.

Charles L. Dunn, Hal A. Kierstead

J. Comb. Theory B, 2004

On-line Ramsey Theory.

Jaroslaw Grytczuk, Mariusz Haluszczak, Henry A. Kierstead

Electron. J. Comb., 2004

Coloring with no 2-Colored P₄'s.

Michael O. Albertson, Glenn G. Chappell, Henry A. Kierstead, André Kündgen, Radhika Ramamurthi

Electron. J. Comb., 2004

2003

Orderings on Graphs and Game Coloring Number.

Hal A. Kierstead, Daqing Yang

Order, 2003

Marking Games and the Oriented Game Chromatic Number of Partial k-Trees.

Hal A. Kierstead, Zsolt Tuza

Graphs Comb., 2003

2002

A Note on Graph Pebbling.

Andrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstead, William T. Trotter

Graphs Comb., 2002

2-factors in dense bipartite graphs.

Andrzej Czygrinow, Henry A. Kierstead

Discret. Math., 2002

2001

Competitive Colorings of Oriented Graphs.

Henry A. Kierstead, William T. Trotter

Electron. J. Comb., 2001

Spanning Trees of Bounded Degree.

Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter

Electron. J. Comb., 2001

2000

A Simple Competitive Graph Coloring Algorithm.

Hal A. Kierstead

J. Comb. Theory B, 2000

Interval orders and dimension.

Henry A. Kierstead, William T. Trotter

Discret. Math., 2000

On the choosability of complete multipartite graphs with part size three.

Henry A. Kierstead

Discret. Math., 2000

Extending partial colorings of graphs.

Hal A. Kierstead

Discret. Math., 2000

1999

On <i>k</i>-ordered Hamiltonian graphs.

Hal A. Kierstead, Gábor N. Sárközy, Stanley M. Selkow

J. Graph Theory, 1999

Hamiltonian chains in hypergraphs.

Gyula Y. Katona, Hal A. Kierstead

J. Graph Theory, 1999

The dimension of two levels of the Boolean lattice.

Hal A. Kierstead

Discret. Math., 1999

1998

Square Hamiltonian cycles in graphs with maximal 4-cliques.

Hal A. Kierstead, Juan Quintana

Discret. Math., 1998

1997

Classes of Graphs that Are Not Vertex Ramsey.

Hal A. Kierstead

SIAM J. Discret. Math., 1997

1996

Partitioning a graph into two square-cycles.

Genghua Fan, Hal A. Kierstead

J. Graph Theory, 1996

On the Order Dimension of 1-Sets versus k-Sets.

Hal A. Kierstead

J. Comb. Theory A, 1996

Hamiltonian Square-Paths.

Genghua Fan, Henry A. Kierstead

J. Comb. Theory B, 1996

Applications of hypergraph coloring to coloring graphs not inducing certain trees.

Hal A. Kierstead, Vojtech Rödl

Discret. Math., 1996

On-Line Coloring of Perfect Graphs.

Hal A. Kierstead, Katalin Kolossa

Comb., 1996

Coloring Graphs On-line.

Hal A. Kierstead

Proceedings of the Online Algorithms, 1996

1995

On-Line and First-Fit Coloring of Graphs That Do Not Induce P₅.

Henry A. Kierstead, Stephen G. Penrice, William T. Trotter

SIAM J. Discret. Math., 1995

The Square of Paths and Cycles.

Genghua Fan, Henry A. Kierstead

J. Comb. Theory B, 1995

Coloring interval graphs with first-fit.

Hal A. Kierstead, Jun Qin

Discret. Math., 1995

1994

On-Line Coloring and Recursive Graph Theory.

Henry A. Kierstead, Stephen G. Penrice, William T. Trotter

SIAM J. Discret. Math., 1994

Radius two trees specify χ-bounded classes.

Henry A. Kierstead, Stephen G. Penrice

J. Graph Theory, 1994

An Explicit 1-Factorization in the Middle of the Boolean Lattice.

D. A. Duffus, Hal A. Kierstead, Hunter S. Snevily

J. Comb. Theory A, 1994

1992

Colorful induced subgraphs.

Hal A. Kierstead, William T. Trotter

Discret. Math., 1992

1991

The Dimension of Random Ordered Sets.

Paul Erdös, Henry A. Kierstead, William T. Trotter

Random Struct. Algorithms, 1991

Fibres and ordered set coloring.

Dwight Duffus, Hal A. Kierstead, William T. Trotter

J. Comb. Theory A, 1991

A polynomial time approximation algorithm for dynamic storage allocation.

Hal A. Kierstead

Discret. Math., 1991

Planar Graph Coloring with an Uncooperative Partner.

Hal A. Kierstead, William T. Trotter

Proceedings of the Planar Graphs, 1991

On-line Graph Coloring.

Hal A. Kierstead, William T. Trotter

Proceedings of the On-Line Algorithms, 1991

1989

Applications of edge coloring of multigraphs to vertex coloring of graphs.

Hal A. Kierstead

Discret. Math., 1989

1988

The Linearity of First-Fit Coloring of Interval Graphs.

Hal A. Kierstead

SIAM J. Discret. Math., 1988

1987

On pi₁-Automorphism of Recursive Linear Orders.

Henry A. Kierstead

J. Symb. Log., 1987

A Ramsey theoretic problem for finite ordered sets.

Hal A. Kierstead, William T. Trotter

Discret. Math., 1987

1986

The chromatic number of graphs which induce neither K_{1, 3} nor K₅-e.

Henry A. Kierstead, James H. Schmerl

Discret. Math., 1986

1984

On the chromatic index of multigraphs without large triangles.

Henry A. Kierstead

J. Comb. Theory B, 1984

A new method of proving theorems on chromatic index.

Andrzej Ehrenfeucht, Vance Faber, Hal A. Kierstead

Discret. Math., 1984

On coloring graphs with locally small chromatic number.

Henry A. Kierstead, Endre Szemerédi, William T. Trotter

Comb., 1984

1983

Indiscernibles and Decidable Models.

Henry A. Kierstead, Jeffrey B. Remmel

J. Symb. Log., 1983

Some applications of Vizing's theorem to vertex colorings of graphs.

Henry A. Kierstead, James H. Schmerl

Discret. Math., 1983