#### Filter Results:

- Full text PDF available (41)

#### Publication Year

1983

2017

- This year (4)
- Last 5 years (18)
- Last 10 years (39)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Michael O. Albertson, Glenn G. Chappell, Hal A. Kierstead, André Kündgen, Radhika Ramamurthi
- Electr. J. Comb.
- 2004

A proper coloring of the vertices of a graph is called a star coloring if every two color classes induce a star forest. Star colorings are a strengthening of acyclic colorings, i.e., proper colorings in which every two color classes induce a forest. We show that every acyclic k-coloring can be refined to a star coloring with at most (2k2 − k) colors.… (More)

- Hal A. Kierstead
- SIAM J. Discrete Math.
- 1988

- Hal A. Kierstead, William T. Trotter
- Planar Graphs
- 1991

- Hal A. Kierstead
- J. Comb. Theory, Ser. B
- 2000

- Hal A. Kierstead, Jun Qin
- Discrete Mathematics
- 1995

- Hal A. Kierstead
- Discrete Mathematics
- 2000

Let Km∗r be the complete r-partite graph with m vertices in each part. Erdős, Rubin, and Taylor showed that K2∗r is r-choosable and suggested the problem of determining the choosability of Km∗r : We show that K3∗r is exactly d(4r − 1)=3e choosable. c © 2000 Elsevier Science B.V. All rights reserved.

- Hal A. Kierstead, Alexandr V. Kostochka
- J. Comb. Theory, Ser. B
- 2008

A proper vertex coloring of a graph is equitable if the sizes of its color classes differ by at most one. In this paper, we prove that if G is a graph such that for each edge xy ∈ E(G), the sum d(x)+ d(y) of the degrees of its ends is at most 2r + 1, then G has an equitable coloring with r + 1 colors. This extends the Hajnal–Szemerédi Theorem on graphs with… (More)

- Hal A. Kierstead
- Discrete Mathematics
- 1991

- Hal A. Kierstead, Gábor N. Sárközy, Stanley M. Selkow
- Journal of Graph Theory
- 1999

A Hamiltonian graph G of order n is k-ordered, 2 ≤ k ≤ n, if for every sequence v1, v2, . . . , vk of k distinct vertices of G, there exists a Hamiltonian cycle that encounters v1, v2, . . . , vk in this order. Define f(k, n) as the smallest integer m for which any graph on n vertices with minimum degree at least m is a k-ordered Hamiltonian graph. In this… (More)

- Genghua Fan, Hal A. Kierstead
- J. Comb. Theory, Ser. B
- 1995