SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Hal A. Kierstead: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Hal A. Kierstead
Coloring Graphs On-line. [Citation Graph (0, 0)][DBLP]
Online Algorithms, 1996, pp:281-305 [Conf]
Hal A. Kierstead, Katalin Kolossa
On-Line Coloring of Perfect Graphs. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1996, v:16, n:4, pp:479-491 [Journal]
Hal A. Kierstead
Extending partial colorings of graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2000, v:219, n:1-3, pp:145-152 [Journal]
Andrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstead, William T. Trotter
A Note on Graph Pebbling. [Citation Graph (0, 0)][DBLP]
Graphs and Combinatorics, 2002, v:18, n:2, pp:219-225 [Journal]
Hal A. Kierstead, Zsolt Tuza
Marking Games and the Oriented Game Chromatic Number of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
Graphs and Combinatorics, 2003, v:19, n:1, pp:121-129 [Journal]
D. A. Duffus, Hal A. Kierstead, Hunter S. Snevily
An Explicit 1-Factorization in the Middle of the Boolean Lattice. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1994, v:65, n:2, pp:334-342 [Journal]
Dwight Duffus, Hal A. Kierstead, William T. Trotter
Fibres and ordered set coloring. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1991, v:58, n:1, pp:158-164 [Journal]
Charles Dunn, Hal A. Kierstead
A simple competitive graph coloring algorithm III. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 2004, v:92, n:1, pp:137-150 [Journal]
Charles Dunn, Hal A. Kierstead
A simple competitive graph coloring algorithm II. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 2004, v:90, n:1, pp:93-106 [Journal]
Hal A. Kierstead
A Simple Competitive Graph Coloring Algorithm. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 2000, v:78, n:1, pp:57-68 [Journal]
Hal A. Kierstead
On the Order Dimension of 1-Sets versus k-Sets. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1996, v:73, n:2, pp:219-228 [Journal]
Noga Alon, Graham Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler
Dominating sets in k-majority tournaments. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 2006, v:96, n:3, pp:374-387 [Journal]
Hal A. Kierstead, Daqing Yang
Orderings on Graphs and Game Coloring Number. [Citation Graph (0, 0)][DBLP]
Order, 2003, v:20, n:3, pp:255-264 [Journal]
Hal A. Kierstead, Daqing Yang
Very Asymmetric Marking Games. [Citation Graph (0, 0)][DBLP]
Order, 2005, v:22, n:2, pp:93-107 [Journal]
Hal A. Kierstead
The Linearity of First-Fit Coloring of Interval Graphs. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1988, v:1, n:4, pp:526-530 [Journal]
Hal A. Kierstead
Classes of Graphs that Are Not Vertex Ramsey. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1997, v:10, n:3, pp:373-380 [Journal]
Hal A. Kierstead, Yingxian Zhu
Radius Three Trees in Graphs with Large Chromatic Number. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 2004, v:17, n:4, pp:571-581 [Journal]
Hal A. Kierstead
Asymmetric graph coloring games. [Citation Graph (0, 0)][DBLP]
Journal of Graph Theory, 2005, v:48, n:3, pp:169-185 [Journal]
Charles Dunn, Hal A. Kierstead
The relaxed game chromatic number of outerplanar graphs. [Citation Graph (0, 0)][DBLP]
Journal of Graph Theory, 2004, v:46, n:1, pp:69-78 [Journal]
Andrzej Ehrenfeucht, V. Faber, Hal A. Kierstead
A new method of proving theorems on chromatic index. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1984, v:52, n:2-3, pp:159-164 [Journal]
Hal A. Kierstead, William T. Trotter
A Ramsey theoretic problem for finite ordered sets. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1987, v:63, n:2-3, pp:217-223 [Journal]
Hal A. Kierstead
Applications of edge coloring of multigraphs to vertex coloring of graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1989, v:74, n:1-2, pp:117-124 [Journal]
Hal A. Kierstead
The dimension of two levels of the Boolean lattice. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1999, v:201, n:1-3, pp:141-155 [Journal]
Hal A. Kierstead, Juan Quintana
Square Hamiltonian cycles in graphs with maximal 4-cliques. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1998, v:178, n:1-3, pp:81-92 [Journal]
Hal A. Kierstead
A polynomial time approximation algorithm for dynamic storage allocation. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1991, v:88, n:2-3, pp:231-237 [Journal]
Hal A. Kierstead, William T. Trotter
Colorful induced subgraphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1992, v:101, n:1-3, pp:165-169 [Journal]
Hal A. Kierstead, Jun Qin
Coloring interval graphs with first-fit. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1995, v:144, n:1-3, pp:47-57 [Journal]
Hal A. Kierstead, Vojtech Rödl
Applications of hypergraph coloring to coloring graphs not inducing certain trees. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1996, v:150, n:1-3, pp:187-193 [Journal]
Coloring number and on-line Ramsey theory for graphs and hypergraphs. [Citation Graph (, )][DBLP]
A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Colouring. [Citation Graph (, )][DBLP]
Efficient Graph Packing via Game Colouring. [Citation Graph (, )][DBLP]
The game of arboricity. [Citation Graph (, )][DBLP]
Asymmetric marking games on line graphs. [Citation Graph (, )][DBLP]
On-line Ramsey Numbers for Paths and Stars. [Citation Graph (, )][DBLP]
Planar graphs are 1-relaxed, 4-choosable. [Citation Graph (, )][DBLP]

Search in 0.004secs, Finished in 0.006secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP