Art S. Finbow

11 papers Journal 11
YearRankTypeTitle / Venue / Authors
2009 J jnl
On well-covered triangulations: Part II.
Discret. Appl. Math.
Art S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer
2008 J jnl
On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs.
Electron. Notes Discret. Math.
Douglas F. Rall, Bostjan Bresar, Art S. Finbow, Sandi Klavzar
2008 J jnl
Open irredundance and maximum degree in graphs.
Discret. Math.
Ernest J. Cockayne, Odile Favaron, Art S. Finbow, Christina M. Mynhardt
2005 J jnl
A lower bound for the CO-irredundance number of a graph.
Discret. Math.
Art S. Finbow
2004 J jnl
Well-located graphs: a collection of well-covered ones.
Discret. Math.
Art S. Finbow, Bert L. Hartnell
2003 J jnl
On well-covered triangulations: Part I.
Discret. Appl. Math.
Art S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer
2000 J jnl
Well-located graphs: A collection of well-covered ones.
Electron. Notes Discret. Math.
Art S. Finbow, Bert L. Hartnell
1995 J jnl
A characterization of parity graphs containing no cycle of order five or less.
Ars Comb.
Art S. Finbow, Bert L. Hartnell
1994 J jnl
A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets.
Discret. Math.
Art S. Finbow, Bert L. Hartnell, Carol A. Whitehead
1993 J jnl
A Characterization of Well Covered Graphs of Girth 5 or Greater.
J. Comb. Theory B
Art S. Finbow, Bert L. Hartnell, Richard J. Nowakowski
1989 J jnl
On designing a network to defend against random attacks of radius two.
Networks
Art S. Finbow, Bert L. Hartnell