Bert L. Hartnell

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