#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1989

2017

- This year (1)
- Last 5 years (2)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Art S. Finbow, Bert Hartnell, Richard J. Nowakowski
- J. Comb. Theory, Ser. B
- 1993

- Art S. Finbow, Douglas F. Rall
- Discrete Applied Mathematics
- 2010

For a positive integer k, a k-packing in a graph G is a subset A of vertices such that the distance between any two distinct vertices from A is more than k. The packing chromatic number of G is the smallest integer m such that the vertex set of G can be partitioned as V1, V2, . . . , Vm where Vi is an i-packing for each i. It is proved that the planar… (More)

- Art S. Finbow, Bert Hartnell
- Ars Comb.
- 1995

- Art S. Finbow, Bert Hartnell, Richard J. Nowakowski
- Journal of Graph Theory
- 1994

- Art S. Finbow, Bert Hartnell, Carol A. Whitehead
- Discrete Mathematics
- 1994

- Art S. Finbow, Bert Hartnell
- Networks
- 1989

- Art S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer
- Discrete Applied Mathematics
- 2003

- Douglas F. Rall, Bostjan Bresar, Art S. Finbow, Sandi Klavzar
- Electronic Notes in Discrete Mathematics
- 2008

- Art S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer
- Discrete Applied Mathematics
- 2010

- Art S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer
- Discrete Applied Mathematics
- 2009

A graph G is said to be well-covered if every maximal independent set of vertices has the same cardinality. A planar (simple) graph in which each face is a triangle is called a triangulation. It was proved in an earlier paper [A. Finbow, B. Hartnell, R. Nowakowski, M. Plummer, On well-covered triangulations: Part I, Discrete Appl. Math., 132, 2004, 97–108]… (More)