According to our database
1,
Hal A. Kierstead
authored at least 102 papers
between 1983 and 2023.
Collaborative distances:
2023
Special issue in honour of Landon Rabern.
Discret. Math., November, 2023
The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree.
Discret. Math., November, 2023
Improved upper bounds on longest-path and maximal-subdivision transversals.
Discret. Math., September, 2023
2022
3-Degenerate induced subgraph of a planar graph.
J. Graph Theory, 2022
On the weak 2-coloring number of planar graphs.
Discret. Math., 2022
2021
Uniform orderings for generalized coloring numbers.
Eur. J. Comb., 2021
Every planar graph is 1-defective (9, 2)-paintable.
Discret. Appl. Math., 2021
2020
Improved lower bounds on the number of edges in list critical and online list critical graphs.
J. Comb. Theory, Ser. B, 2020
On coloring numbers of graph powers.
Discret. Math., 2020
2019
Chromatic numbers of exact distance graphs.
J. Comb. Theory, Ser. B, 2019
2018
A Sharp Dirac-Erdős Type Bound for Large Graphs.
Comb. Probab. Comput., 2018
An Easy Subexponential Bound for Online Chain Partitioning.
Electron. J. Comb., 2018
2017
Extracting List Colorings from Large Independent Sets.
J. Graph Theory, 2017
Strengthening Theorems of Dirac and Erdős on Disjoint Cycles.
J. Graph Theory, 2017
On the Corrádi-Hajnal theorem and a question of Dirac.
J. Comb. Theory, Ser. B, 2017
The (2k-1)-connected multigraphs with at most k-1 disjoint cycles.
Comb., 2017
2016
On the choice number of complete multipartite graphs with part size four.
Eur. J. Comb., 2016
First-fit coloring on interval graphs has performance ratio at least 5.
Eur. J. Comb., 2016
2015
On choosability with separation of planar graphs with lists of different sizes.
Discret. Math., 2015
Edge coloring multigraphs without small dense subsets.
Discret. Math., 2015
An Extension of the Hajnal-Szemerédi Theorem to Directed Graphs.
Comb. Probab. Comput., 2015
A refinement of a result of Corrádi and Hajnal.
Comb., 2015
Upper and lower bounds of Choice Number for successful channel assignment in cellular networks.
Proceedings of the 2015 IEEE International Conference on Communications, 2015
2014
On directed versions of the Corrádi-Hajnal corollary.
Eur. J. Comb., 2014
Generalized Dynamic Storage Allocation.
Discret. Math. Theor. Comput. Sci., 2014
An Improved Subexponential Bound for On-line Chain Partitioning.
CoRR, 2014
2013
Equitable List Coloring of Graphs with Bounded Degree.
J. Graph Theory, 2013
On first-fit coloring of ladder-free posets.
Eur. J. Comb., 2013
2012
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring.
J. Graph Theory, 2012
Adapted game colouring of graphs.
Eur. J. Comb., 2012
2011
Pósa's conjecture for graphs of order at least 2 × 10<sup>8</sup>.
Random Struct. Algorithms, 2011
A note on relaxed equitable coloring of graphs.
Inf. Process. Lett., 2011
First-Fit coloring of bounded tolerance graphs.
Discret. Appl. Math., 2011
2010
2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees.
SIAM J. Discret. Math., 2010
Planar graphs are 1-relaxed, 4-choosable.
Eur. J. Comb., 2010
A fast algorithm for equitable coloring.
Comb., 2010
Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture.
Comb., 2010
2009
The Two-Coloring Number and Degenerate Colorings of Planar Graphs.
SIAM J. Discret. Math., 2009
Star coloring bipartite planar graphs.
J. Graph Theory, 2009
Ore-type versions of Brooks' theorem.
J. Comb. Theory, Ser. B, 2009
Efficient Graph Packing via Game Colouring.
Comb. Probab. Comput., 2009
Coloring number and on-line Ramsey theory for graphs and hypergraphs.
Comb., 2009
2008
An Ore-type theorem on equitable coloring.
J. Comb. Theory, Ser. B, 2008
On-line Ramsey Numbers for Paths and Stars.
Discret. Math. Theor. Comput. Sci., 2008
Asymmetric marking games on line graphs.
Discret. Math., 2008
A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Colouring.
Comb. Probab. Comput., 2008
2007
2006
Dominating sets in k-majority tournaments.
J. Comb. Theory, Ser. B, 2006
Weak acyclic coloring and asymmetric coloring games.
Discret. Math., 2006
2005
Very Asymmetric Marking Games.
Order, 2005
Asymmetric graph coloring games.
J. Graph Theory, 2005
2004
Radius Three Trees in Graphs with Large Chromatic Number.
SIAM J. Discret. Math., 2004
Explicit 2-Factorisations of the Odd Graph.
Order, 2004
The relaxed game chromatic number of outerplanar graphs.
J. Graph Theory, 2004
A simple competitive graph coloring algorithm II.
J. Comb. Theory, Ser. B, 2004
A simple competitive graph coloring algorithm III.
J. Comb. Theory, Ser. B, 2004
Coloring with no 2-Colored P<sub>4</sub>'s.
Electron. J. Comb., 2004
2003
Orderings on Graphs and Game Coloring Number.
Order, 2003
Marking Games and the Oriented Game Chromatic Number of Partial k-Trees.
Graphs Comb., 2003
2002
A Note on Graph Pebbling.
Graphs Comb., 2002
2-factors in dense bipartite graphs.
Discret. Math., 2002
2001
Competitive Colorings of Oriented Graphs.
Electron. J. Comb., 2001
Spanning Trees of Bounded Degree.
Electron. J. Comb., 2001
2000
A Simple Competitive Graph Coloring Algorithm.
J. Comb. Theory, Ser. B, 2000
Interval orders and dimension.
Discret. Math., 2000
On the choosability of complete multipartite graphs with part size three.
Discret. Math., 2000
Extending partial colorings of graphs.
Discret. Math., 2000
1999
On <i>k</i>-ordered Hamiltonian graphs.
J. Graph Theory, 1999
Hamiltonian chains in hypergraphs.
J. Graph Theory, 1999
The dimension of two levels of the Boolean lattice.
Discret. Math., 1999
1998
Square Hamiltonian cycles in graphs with maximal 4-cliques.
Discret. Math., 1998
1997
Classes of Graphs that Are Not Vertex Ramsey.
SIAM J. Discret. Math., 1997
1996
Partitioning a graph into two square-cycles.
J. Graph Theory, 1996
On the Order Dimension of 1-Sets versus k-Sets.
J. Comb. Theory, Ser. A, 1996
Hamiltonian Square-Paths.
J. Comb. Theory, Ser. B, 1996
Applications of hypergraph coloring to coloring graphs not inducing certain trees.
Discret. Math., 1996
On-Line Coloring of Perfect Graphs.
Comb., 1996
Proceedings of the Online Algorithms, 1996
1995
On-Line and First-Fit Coloring of Graphs That Do Not Induce P<sub>5</sub>.
SIAM J. Discret. Math., 1995
The Square of Paths and Cycles.
J. Comb. Theory, Ser. B, 1995
Coloring interval graphs with first-fit.
Discret. Math., 1995
1994
On-Line Coloring and Recursive Graph Theory.
SIAM J. Discret. Math., 1994
Radius two trees specify χ-bounded classes.
J. Graph Theory, 1994
An Explicit 1-Factorization in the Middle of the Boolean Lattice.
J. Comb. Theory, Ser. A, 1994
1992
Colorful induced subgraphs.
Discret. Math., 1992
1991
The Dimension of Random Ordered Sets.
Random Struct. Algorithms, 1991
Fibres and ordered set coloring.
J. Comb. Theory, Ser. A, 1991
A polynomial time approximation algorithm for dynamic storage allocation.
Discret. Math., 1991
Planar Graph Coloring with an Uncooperative Partner.
Proceedings of the Planar Graphs, 1991
Proceedings of the On-Line Algorithms, 1991
1989
Applications of edge coloring of multigraphs to vertex coloring of graphs.
Discret. Math., 1989
1988
The Linearity of First-Fit Coloring of Interval Graphs.
SIAM J. Discret. Math., 1988
1987
On pi<sub>1</sub>-Automorphism of Recursive Linear Orders.
J. Symb. Log., 1987
A Ramsey theoretic problem for finite ordered sets.
Discret. Math., 1987
1986
The chromatic number of graphs which induce neither K<sub>1, 3</sub> nor K<sub>5</sub>-e.
Discret. Math., 1986
1984
On the chromatic index of multigraphs without large triangles.
J. Comb. Theory, Ser. B, 1984
A new method of proving theorems on chromatic index.
Discret. Math., 1984
On coloring graphs with locally small chromatic number.
Comb., 1984
1983
Indiscernibles and Decidable Models.
J. Symb. Log., 1983
Some applications of Vizing's theorem to vertex colorings of graphs.
Discret. Math., 1983
