Edge partitions of complete multipartite graphs into equal length circuits. - Ernest J. Cockayne; Bert L. Hartnell (J. Comb. Theory B, 1977)

A linear algorithm for disjoint matchings in trees. - Ernest J. Cockayne; Bert L. Hartnell; Stephen T. Hedetniemi (Discret. Math., 1978)

Optimal K-secure graphs. - Georg Gunther; Bert L. Hartnell (Discret. Appl. Math., 1980)

Neighbor-connected graphs and projective planes. - Georg Gunther; Bert L. Hartnell; Richard J. Nowakowski (Networks, 1987)

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

On minimal neighbourhood-connected graphs. - Bert L. Hartnell; William L. Kocay (Discret. Math., 1991)

Graphs whose Vertex Independence Number is Unaffected by Single Edge Addition of Deletion. - Georg Gunther; Bert L. Hartnell; Douglas F. Rall (Discret. Appl. Math., 1993)

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)

Bounds on the bondage number of a graph. - Bert L. Hartnell; Douglas F. Rall (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)

Vizing's conjecture and the one-half argument. - Bert L. Hartnell; Douglas F. Rall (Discuss. Math. Graph Theory, 1995)

On 4-connected Claw-free Well-covered Graphs. - Bert L. Hartnell; Michael D. Plummer (Discret. Appl. Math., 1996)

Star-factors and k-bounded total domination. - Georg Gunther; Bert L. Hartnell; Douglas F. Rall (Networks, 1996)

On The Local Structure Of Well-Covered Graphs Without 4-Cycles. - Bert L. Hartnell (Ars Comb., 1997)

On k-packings of graphs. - Bert L. Hartnell; Carol A. Whitehead (Ars Comb., 1997)

Paired-domination. - Shannon L. Fitzpatrick; Bert L. Hartnell (Discuss. Math. Graph Theory, 1998)

A bound on the size of a graph with given order and bondage number. - Bert L. Hartnell; Douglas F. Rall (Discret. Math., 1999)

On Determining the 2-Packing and Domination Numbers of the Cartesian Product of Certain Graphs. - Bert L. Hartnell (Ars Comb., 2000)

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

A characterization of Zm-well-covered graphs of girth 6 or more. - Yair Caro; Bert L. Hartnell (J. Graph Theory, 2000)

Characterization of Zm-well-covered graphs for some classes of graphs. - Rommel M. Barbosa; Bert L. Hartnell (Discret. Math., 2001)

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

Improving some bounds for dominating Cartesian products. - Bert L. Hartnell; Douglas F. Rall (Discuss. Math. Graph Theory, 2003)

A game based on vertex-magic total labelings. - E. Boudreau; Bert L. Hartnell; K. Schmeisser; J. Whiteley (Australas. J Comb., 2004)

On dominating the Cartesian product of a graph and K2. - Bert L. Hartnell; Douglas F. Rall (Discuss. Math. Graph Theory, 2004)

Dominating sets with at most k components. - Bert L. Hartnell; Preben D. Vestergaard (Ars Comb., 2005)

On graphs having uniform size star factors. - Bert L. Hartnell; Douglas F. Rall (Australas. J Comb., 2006)

Decycling sets in certain cartesian product graphs with one factor complete. - Bert L. Hartnell; Carol A. Whitehead (Australas. J Comb., 2008)

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

A note on equimatchable graphs. - Allan Frendrup; Bert L. Hartnell; Preben D. Vestergaard (Australas. J Comb., 2010)

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

Limited packings in graphs. - Robert P. Gallant; Georg Gunther; Bert L. Hartnell; Douglas F. Rall (Discret. Appl. Math., 2010)

Well paired-dominated graphs. - Shannon L. Fitzpatrick; Bert L. Hartnell (J. Comb. Optim., 2010)

Vizing's conjecture: a survey and recent results. - Bostjan Bresar; Paul Dorbec; Wayne Goddard; Bert L. Hartnell; Michael A. Henning; Sandi Klavzar; Douglas F. Rall (J. Graph Theory, 2012)

On the Cartesian Product of Non Well-Covered Graphs. - Bert L. Hartnell; Douglas F. Rall (Electron. J. Comb., 2013)

On Graphs Having Maximal Independent Sets of Exactly t Distinct Cardinalities. - Bert L. Hartnell; Douglas F. Rall (Graphs Comb., 2013)

Independent protection in graphs. - Bert L. Hartnell; Christina M. Mynhardt (Discret. Math., 2014)

Paired versus double domination in K 1, r -free graphs. - Paul Dorbec; Bert L. Hartnell; Michael A. Henning (J. Comb. Optim., 2014)

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

Uniformly dissociated graphs. - Bostjan Bresar; Bert L. Hartnell; Douglas F. Rall (Ars Math. Contemp., 2017)

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

On Well-Covered Cartesian Products. - Bert L. Hartnell; Douglas F. Rall; Kirsti Wash (Graphs Comb., 2018)

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

A new framework to approach Vizing's conjecture. - Bostjan Bresar; Bert L. Hartnell; Michael A. Henning; Kirsti Kuenzel; Douglas F. Rall (Discuss. Math. Graph Theory, 2021)

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