The SCEAS System
| |||||||

## Search the dblp DataBase
Henry A. Kierstead:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Henry A. Kierstead, Endre Szemerédi, William T. Trotter
**On coloring graphs with locally small chromatic number.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1984, v:4, n:2, pp:183-185 [Journal] - Michael O. Albertson, Glenn G. Chappell, Henry A. Kierstead, André Kündgen, Radhika Ramamurthi
**Coloring with no 2-Colored P4's.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal] - Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter
**Spanning Trees of Bounded Degree.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal] - Jaroslaw Grytczuk, Mariusz Haluszczak, Henry A. Kierstead
**On-line Ramsey Theory.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal] - Henry A. Kierstead, William T. Trotter
**Competitive Colorings of Oriented Graphs.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2001, v:8, n:2, pp:- [Journal] - Andrzej Czygrinow, Henry A. Kierstead
**2-factors in dense bipartite graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:257, n:2-3, pp:357-369 [Journal] - Henry A. Kierstead
**On the choosability of complete multipartite graphs with part size three.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:211, n:, pp:255-259 [Journal] - Henry A. Kierstead
**Weak acyclic coloring and asymmetric coloring games.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:7, pp:673-677 [Journal] - Henry A. Kierstead, William T. Trotter
**Interval orders and dimension.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:213, n:1-3, pp:179-188 [Journal] - Genghua Fan, Henry A. Kierstead
**The Square of Paths and Cycles.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1995, v:63, n:1, pp:55-64 [Journal] - Genghua Fan, Henry A. Kierstead
**Hamiltonian Square-Paths.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1996, v:67, n:2, pp:167-182 [Journal] - Henry A. Kierstead
**On the chromatic index of multigraphs without large triangles.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1984, v:36, n:2, pp:156-160 [Journal] - Henry A. Kierstead
**On pi**[Citation Graph (0, 0)][DBLP]_{1}-Automorphism of Recursive Linear Orders. J. Symb. Log., 1987, v:52, n:3, pp:681-688 [Journal] - Henry A. Kierstead, Jeffrey B. Remmel
**Indiscernibles and Decidable Models.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1983, v:48, n:1, pp:21-32 [Journal] - J. Robert Johnson, Henry A. Kierstead
**Explicit 2-Factorisations of the Odd Graph.**[Citation Graph (0, 0)][DBLP] Order, 2004, v:21, n:1, pp:19-27 [Journal] - Paul Erdös, Henry A. Kierstead, William T. Trotter
**The Dimension of Random Ordered Sets.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1991, v:2, n:3, pp:254-276 [Journal] - Henry A. Kierstead, Stephen G. Penrice, William T. Trotter
**On-Line Coloring and Recursive Graph Theory.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1994, v:7, n:1, pp:72-89 [Journal] - Henry A. Kierstead, Stephen G. Penrice, William T. Trotter
**On-Line and First-Fit Coloring of Graphs That Do Not Induce P**[Citation Graph (0, 0)][DBLP]_{5}. SIAM J. Discrete Math., 1995, v:8, n:4, pp:485-498 [Journal] - Henry A. Kierstead, James H. Schmerl
**The chromatic number of graphs which induce neither K**[Citation Graph (0, 0)][DBLP]_{1, 3}nor K_{5}-e. Discrete Mathematics, 1986, v:58, n:3, pp:253-262 [Journal] - Henry A. Kierstead, James H. Schmerl
**Some applications of Vizing's theorem to vertex colorings of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1983, v:45, n:2-3, pp:277-285 [Journal]
Search in 0.023secs, Finished in 0.025secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |