Bert L. Hartnell

Publication Activity (10 Years)

Years Active: 1977-2022
Publications (10 Years): 7

Top Topics

Independent Set

Polar Coordinates

Cartesian Product

Top Venues

Discret. Appl. Math.

J. Comb. Optim.

Electron. J. Comb.

Publications

Arthur S. Finbow, Bert L. Hartnell, Michael D. Plummer
A characterization of well-indumatchable graphs having girth greater than seven. Discret. Appl. Math. 321 (2022)
Bostjan Bresar, Bert L. Hartnell, Michael A. Henning, Kirsti Kuenzel, Douglas F. Rall
A new framework to approach Vizing's conjecture. Discuss. Math. Graph Theory 41 (3) (2021)
Arthur S. Finbow, Bert L. Hartnell, Michael D. Plummer
On the structure of 4-regular planar well-covered graphs. Discret. Appl. Math. 283 (2020)
Bert L. Hartnell, Douglas F. Rall, Kirsti Wash
On Well-Covered Cartesian Products. Graphs Comb. 34 (6) (2018)
Arthur S. Finbow, Bert L. Hartnell, Michael D. Plummer
On well-covered pentagonalizations of the plane. Discret. Appl. Math. 224 (2017)
Bostjan Bresar, Bert L. Hartnell, Douglas F. Rall
Uniformly dissociated graphs. Ars Math. Contemp. 13 (2) (2017)
Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer
Well-covered triangulations: Part IV. Discret. Appl. Math. 215 (2016)
Paul Dorbec, Bert L. Hartnell, Michael A. Henning
Paired versus double domination in K 1, r -free graphs. J. Comb. Optim. 27 (4) (2014)
Bert L. Hartnell, Christina M. Mynhardt
Independent protection in graphs. Discret. Math. 335 (2014)
Bert L. Hartnell, Douglas F. Rall
On the Cartesian Product of Non Well-Covered Graphs. Electron. J. Comb. 20 (2) (2013)
Bert L. Hartnell, Douglas F. Rall
On Graphs Having Maximal Independent Sets of Exactly t Distinct Cardinalities. Graphs Comb. 29 (3) (2013)
Bostjan Bresar, Paul Dorbec, Wayne Goddard, Bert L. Hartnell, Michael A. Henning, Sandi Klavzar, Douglas F. Rall
Vizing's conjecture: a survey and recent results. J. Graph Theory 69 (1) (2012)
Bert L. Hartnell, Douglas F. Rall
On the Cartesian product of non well-covered graphs CoRR (2012)
Shannon L. Fitzpatrick, Bert L. Hartnell
Well paired-dominated graphs. J. Comb. Optim. 20 (2) (2010)
Allan Frendrup, Bert L. Hartnell, Preben D. Vestergaard
A note on equimatchable graphs. Australas. J Comb. 46 (2010)
Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer
On well-covered triangulations: Part III. Discret. Appl. Math. 158 (8) (2010)
Robert P. Gallant, Georg Gunther, Bert L. Hartnell, Douglas F. Rall
Limited packings in graphs. Discret. Appl. Math. 158 (12) (2010)
Art S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer
On well-covered triangulations: Part II. Discret. Appl. Math. 157 (13) (2009)
Bert L. Hartnell, Carol A. Whitehead
Decycling sets in certain cartesian product graphs with one factor complete. Australas. J Comb. 40 (2008)
Robert P. Gallant, Georg Gunther, Bert L. Hartnell, Douglas F. Rall
Limited Packings in Graphs. Electron. Notes Discret. Math. 30 (2008)
Bert L. Hartnell, Douglas F. Rall
On graphs having uniform size star factors. Australas. J Comb. 34 (2006)
Bert L. Hartnell, Preben D. Vestergaard
Dominating sets with at most k components. Ars Comb. 74 (2005)
Art S. Finbow, Bert L. Hartnell
Well-located graphs: a collection of well-covered ones. Discret. Math. 276 (1-3) (2004)
E. Boudreau, Bert L. Hartnell, K. Schmeisser, J. Whiteley
A game based on vertex-magic total labelings. Australas. J Comb. 29 (2004)
Bert L. Hartnell, Douglas F. Rall
. Discuss. Math. Graph Theory 24 (3) (2004)
Bert L. Hartnell, Douglas F. Rall
Improving some bounds for dominating Cartesian products. Discuss. Math. Graph Theory 23 (2) (2003)
Art S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer
On well-covered triangulations: Part I. Discret. Appl. Math. 132 (1-3) (2003)
Rommel M. Barbosa, Bert L. Hartnell
-well-covered graphs for some classes of graphs. Discret. Math. 233 (1-3) (2001)
Bert L. Hartnell
On Determining the 2-Packing and Domination Numbers of the Cartesian Product of Certain Graphs. Ars Comb. 55 (2000)
Yair Caro, Bert L. Hartnell
-well-covered graphs of girth 6 or more. J. Graph Theory 33 (4) (2000)
Art S. Finbow, Bert L. Hartnell
Well-located graphs: A collection of well-covered ones. Electron. Notes Discret. Math. 5 (2000)
Bert L. Hartnell, Douglas F. Rall
A bound on the size of a graph with given order and bondage number. Discret. Math. (1999)
Shannon L. Fitzpatrick, Bert L. Hartnell
Paired-domination. Discuss. Math. Graph Theory 18 (1) (1998)
Bert L. Hartnell, Carol A. Whitehead
On k-packings of graphs. Ars Comb. 47 (1997)
Bert L. Hartnell
On The Local Structure Of Well-Covered Graphs Without 4-Cycles. Ars Comb. 45 (1997)
Bert L. Hartnell, Michael D. Plummer
On 4-connected Claw-free Well-covered Graphs. Discret. Appl. Math. 64 (1) (1996)
Georg Gunther, Bert L. Hartnell, Douglas F. Rall
Star-factors and k-bounded total domination. Networks 27 (3) (1996)
Bert L. Hartnell, Douglas F. Rall
Vizing's conjecture and the one-half argument. Discuss. Math. Graph Theory 15 (2) (1995)
Art S. Finbow, Bert L. Hartnell
A characterization of parity graphs containing no cycle of order five or less. Ars Comb. 40 (1995)
Art Stephen Finbow, Bert L. Hartnell, Richard J. Nowakowski
A characterization of well-covered graphs that contain neither 4- nor 5-cycles. J. Graph Theory 18 (7) (1994)
Bert L. Hartnell, Douglas F. Rall
Bounds on the bondage number of a graph. Discret. Math. 128 (1-3) (1994)
Art S. Finbow, Bert L. Hartnell, Carol A. Whitehead
A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets. Discret. Math. 125 (1-3) (1994)
Art S. Finbow, Bert L. Hartnell, Richard J. Nowakowski
A Characterization of Well Covered Graphs of Girth 5 or Greater. J. Comb. Theory, Ser. B 57 (1) (1993)
Georg Gunther, Bert L. Hartnell, Douglas F. Rall
Graphs whose Vertex Independence Number is Unaffected by Single Edge Addition of Deletion. Discret. Appl. Math. 46 (2) (1993)
Bert L. Hartnell, William L. Kocay
On minimal neighbourhood-connected graphs. Discret. Math. 92 (1-3) (1991)
Art S. Finbow, Bert L. Hartnell
On designing a network to defend against random attacks of radius two. Networks 19 (7) (1989)
Georg Gunther, Bert L. Hartnell, Richard J. Nowakowski
Neighbor-connected graphs and projective planes. Networks 17 (2) (1987)
Georg Gunther, Bert L. Hartnell
Optimal K-secure graphs. Discret. Appl. Math. 2 (3) (1980)
Ernest J. Cockayne, Bert L. Hartnell, Stephen T. Hedetniemi
A linear algorithm for disjoint matchings in trees. Discret. Math. 21 (2) (1978)
Ernest J. Cockayne, Bert L. Hartnell
Edge partitions of complete multipartite graphs into equal length circuits. J. Comb. Theory, Ser. B 23 (2-3) (1977)