On designing a network to defend against random attacks of radius two. - Art S. Finbow; Bert L. Hartnell (Networks, 1989)

A Characterization of Well Covered Graphs of Girth 5 or Greater. - Art S. Finbow; Bert L. Hartnell; Richard J. Nowakowski (J. Comb. Theory B, 1993)

A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets. - Art S. Finbow; Bert L. Hartnell; Carol A. Whitehead (Discret. Math., 1994)

A characterization of well-covered graphs that contain neither 4- nor 5-cycles. - Art Stephen Finbow; Bert L. Hartnell; Richard J. Nowakowski (J. Graph Theory, 1994)

A characterization of parity graphs containing no cycle of order five or less. - Art S. Finbow; Bert L. Hartnell (Ars Comb., 1995)

Well-located graphs: A collection of well-covered ones. - Art S. Finbow; Bert L. Hartnell (Electron. Notes Discret. Math., 2000)

On well-covered triangulations: Part I. - Art S. Finbow; Bert L. Hartnell; Richard J. Nowakowski; Michael D. Plummer (Discret. Appl. Math., 2003)

Generalised irredundance in graphs: Nordhaus-Gaddum bounds. - Ernest J. Cockayne; Art Stephen Finbow (Discuss. Math. Graph Theory, 2004)

A lower bound for the CO-irredundance number of a graph. - Art S. Finbow (Discret. Math., 2005)

Open irredundance and maximum degree in graphs. - Ernest J. Cockayne; Odile Favaron; Art S. Finbow; Christina M. Mynhardt (Discret. Math., 2008)

On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs. - Douglas F. Rall; Bostjan Bresar; Art S. Finbow; Sandi Klavzar (Electron. Notes Discret. Math., 2008)

On well-covered triangulations: Part II. - Art S. Finbow; Bert L. Hartnell; Richard J. Nowakowski; Michael D. Plummer (Discret. Appl. Math., 2009)

On well-covered triangulations: Part III. - Arthur S. Finbow; Bert L. Hartnell; Richard J. Nowakowski; Michael D. Plummer (Discret. Appl. Math., 2010)

On the packing chromatic number of some lattices. - Arthur S. Finbow; Douglas F. Rall (Discret. Appl. Math., 2010)

Well-covered triangulations: Part IV. - Arthur S. Finbow; Bert L. Hartnell; Richard J. Nowakowski; Michael D. Plummer (Discret. Appl. Math., 2016)

On well-covered pentagonalizations of the plane. - Arthur S. Finbow; Bert L. Hartnell; Michael D. Plummer (Discret. Appl. Math., 2017)

On the structure of 4-regular planar well-covered graphs. - Arthur S. Finbow; Bert L. Hartnell; Michael D. Plummer (Discret. Appl. Math., 2020)

A characterization of well-indumatchable graphs having girth greater than seven. - Arthur S. Finbow; Bert L. Hartnell; Michael D. Plummer (Discret. Appl. Math., 2022)