| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Hal A. Kierstead, Chung-Ying Yang, Daqing Yang, Xuding Zhu |
Adapted game colouring of graphs.  |
Eur. J. Comb.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Phong Châu, Louis DeBiasio, Hal A. Kierstead |
Pósa's conjecture for graphs of order at least 2 × 108. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead, Karin R. Saoub |
First-Fit coloring of bounded tolerance graphs. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | William Cushing, Hal A. Kierstead |
Planar graphs are 1-relaxed, 4-choosable. |
Eur. J. Comb. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Czygrinow, Louis DeBiasio, Hal A. Kierstead |
2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi |
A fast algorithm for equitable coloring. |
Combinatorica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry A. Kierstead, Alexandr V. Kostochka |
Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture. |
Combinatorica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead, Alexandr V. Kostochka |
Ore-type versions of Brooks' theorem. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead, Alexandr V. Kostochka |
Efficient Graph Packing via Game Colouring. |
Combinatorics, Probability & Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead, Goran Konjevod |
Coloring number and on-line Ramsey theory for graphs and hypergraphs. |
Combinatorica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead, Bojan Mohar, Simon Spacapan, Daqing Yang, Xuding Zhu |
The Two-Coloring Number and Degenerate Colorings of Planar Graphs. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead, André Kündgen, Craig Timmons |
Star coloring bipartite planar graphs. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead, Alexandr V. Kostochka |
An Ore-type theorem on equitable coloring. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daqing Yang, Hal A. Kierstead |
Asymmetric marking games on line graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Bartnicki, Jaroslaw Grytczuk, Hal A. Kierstead |
The game of arboricity. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaroslaw Grytczuk, Hal A. Kierstead, Pawel Pralat |
On-line Ramsey Numbers for Paths and Stars. |
Discrete Mathematics & Theoretical Computer Science |
2008 |
DBLP BibTeX RDF |
|
| 1 | Hal A. Kierstead, Alexandr V. Kostochka |
A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Colouring. |
Combinatorics, Probability & Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Graham Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler |
Dominating sets in k-majority tournaments. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry A. Kierstead |
Weak acyclic coloring and asymmetric coloring games. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead, Daqing Yang |
Very Asymmetric Marking Games. |
Order |
2005 |
DBLP DOI BibTeX RDF |
coloring number, competitive coloring, planar graph |
| 1 | Hal A. Kierstead |
Asymmetric graph coloring games. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles Dunn, Hal A. Kierstead |
A simple competitive graph coloring algorithm III. |
J. Comb. Theory, Ser. B |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles Dunn, Hal A. Kierstead |
A simple competitive graph coloring algorithm II. |
J. Comb. Theory, Ser. B |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead, Yingxian Zhu |
Radius Three Trees in Graphs with Large Chromatic Number. |
SIAM J. Discrete Math. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles Dunn, Hal A. Kierstead |
The relaxed game chromatic number of outerplanar graphs. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael O. Albertson, Glenn G. Chappell, Henry A. Kierstead, André Kündgen, Radhika Ramamurthi |
Coloring with no 2-Colored P4's. |
Electr. J. Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Jaroslaw Grytczuk, Mariusz Haluszczak, Henry A. Kierstead |
On-line Ramsey Theory. |
Electr. J. Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | J. Robert Johnson, Henry A. Kierstead |
Explicit 2-Factorisations of the Odd Graph. |
Order |
2004 |
DBLP DOI BibTeX RDF |
odd graph, Kneser graph, 2-factor |
| 1 | Hal A. Kierstead, Zsolt Tuza |
Marking Games and the Oriented Game Chromatic Number of Partial k-Trees. |
Graphs and Combinatorics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead, Daqing Yang |
Orderings on Graphs and Game Coloring Number. |
Order |
2003 |
DBLP DOI BibTeX RDF |
k-coloring number, k-game coloring number, planar graphs |
| 1 | Andrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstead, William T. Trotter |
A Note on Graph Pebbling. |
Graphs and Combinatorics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Czygrinow, Henry A. Kierstead |
2-factors in dense bipartite graphs. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter |
Spanning Trees of Bounded Degree. |
Electr. J. Comb. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Henry A. Kierstead, William T. Trotter |
Competitive Colorings of Oriented Graphs. |
Electr. J. Comb. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Hal A. Kierstead |
A Simple Competitive Graph Coloring Algorithm. |
J. Comb. Theory, Ser. B |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead |
Extending partial colorings of graphs. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry A. Kierstead |
On the choosability of complete multipartite graphs with part size three. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry A. Kierstead, William T. Trotter |
Interval orders and dimension. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead |
The dimension of two levels of the Boolean lattice. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead, Juan Quintana |
Square Hamiltonian cycles in graphs with maximal 4-cliques. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead |
Classes of Graphs that Are Not Vertex Ramsey. |
SIAM J. Discrete Math. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead |
On the Order Dimension of 1-Sets versus k-Sets. |
J. Comb. Theory, Ser. A |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead, Vojtech Rödl |
Applications of hypergraph coloring to coloring graphs not inducing certain trees. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead, Katalin Kolossa |
On-Line Coloring of Perfect Graphs. |
Combinatorica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead |
Coloring Graphs On-line. |
Online Algorithms |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Genghua Fan, Henry A. Kierstead |
Hamiltonian Square-Paths. |
J. Comb. Theory, Ser. B |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead, Jun Qin |
Coloring interval graphs with first-fit. |
Discrete Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Genghua Fan, Henry A. Kierstead |
The Square of Paths and Cycles. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry A. Kierstead, Stephen G. Penrice, William T. Trotter |
On-Line and First-Fit Coloring of Graphs That Do Not Induce P5. |
SIAM J. Discrete Math. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1994 |
DBLP BibTeX RDF |
|
| 1 | Henry A. Kierstead, Stephen G. Penrice, William T. Trotter |
On-Line Coloring and Recursive Graph Theory. |
SIAM J. Discrete Math. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead, William T. Trotter |
Colorful induced subgraphs. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Dwight Duffus, Hal A. Kierstead, William T. Trotter |
Fibres and ordered set coloring. |
J. Comb. Theory, Ser. A |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead |
A polynomial time approximation algorithm for dynamic storage allocation. |
Discrete Mathematics |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Henry A. Kierstead, William T. Trotter |
The Dimension of Random Ordered Sets. |
Random Struct. Algorithms |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead |
Applications of edge coloring of multigraphs to vertex coloring of graphs. |
Discrete Mathematics |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead |
The Linearity of First-Fit Coloring of Interval Graphs. |
SIAM J. Discrete Math. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Hal A. Kierstead, William T. Trotter |
A Ramsey theoretic problem for finite ordered sets. |
Discrete Mathematics |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry A. Kierstead |
On pi1-Automorphism of Recursive Linear Orders. |
J. Symb. Log. |
1987 |
DBLP BibTeX RDF |
|
| 1 | Henry A. Kierstead, James H. Schmerl |
The chromatic number of graphs which induce neither K1, 3 nor K5-e. |
Discrete Mathematics |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Ehrenfeucht, V. Faber, Hal A. Kierstead |
A new method of proving theorems on chromatic index. |
Discrete Mathematics |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry A. Kierstead |
On the chromatic index of multigraphs without large triangles. |
J. Comb. Theory, Ser. B |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry A. Kierstead, Endre Szemerédi, William T. Trotter |
On coloring graphs with locally small chromatic number. |
Combinatorica |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry A. Kierstead, James H. Schmerl |
Some applications of Vizing's theorem to vertex colorings of graphs. |
Discrete Mathematics |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry A. Kierstead, Jeffrey B. Remmel |
Indiscernibles and Decidable Models. |
J. Symb. Log. |
1983 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")