Bert Hartnell

发表

On Well-Covered Cartesian Products

Douglas F. Rall, Bert Hartnell, Kirsti Wash, 2018, Graphs Comb..

On the Cartesian product of non well-covered graphs

Douglas F. Rall, Bert Hartnell, 2013, Electron. J. Comb..

A characterization of well-covered graphs that contain neither 4- nor 5-cycles

Richard J. Nowakowski, Bert Hartnell, Art S. Finbow, 1994, J. Graph Theory.

A Characterization of Well Covered Graphs of Girth 5 or Greater

Richard J. Nowakowski, Bert Hartnell, Art S. Finbow, 1993, J. Comb. Theory, Ser. B.

Well-covered triangulations: Part IV

Michael D. Plummer, Richard J. Nowakowski, Bert Hartnell, 2016, Discret. Appl. Math..

Dominating sets with at most k components

Preben D. Vestergaard, Bert Hartnell, B. Hartnell, 2005, Ars Comb..

Vizing's conjecture and the one-half argument

Douglas F. Rall, Bert Hartnell, 1995, Discuss. Math. Graph Theory.

On well-covered triangulations: Part I

Michael D. Plummer, Richard J. Nowakowski, Bert Hartnell, 2003, Discret. Appl. Math..

Independent protection in graphs

Bert Hartnell, Christina M. Mynhardt, 2014, Discret. Math..

On minimal neighbourhood-connected graphs

William Kocay, Bert Hartnell, 1991, Discret. Math..

Optimal K-secure graphs

Bert Hartnell, Georg Gunther, 1980, Discret. Appl. Math..

Paired versus double domination in K1,r-free graphs

Paul Dorbec, Michael A. Henning, Bert Hartnell, 2014, J. Comb. Optim..

Limited packings in graphs

Douglas F. Rall, Bert Hartnell, Robert P. Gallant, 2008, Discret. Appl. Math..

Neighbor-connected graphs and projective planes

Richard J. Nowakowski, Bert Hartnell, Georg Gunther, 1987, Networks.

A game based on vertex-magic total labelings

Bert Hartnell, E. Boudreau, K. Schmeisser, 2004, Australas. J Comb..

A bound on the size of a graph with given order and bondage number

Douglas F. Rall, Bert Hartnell, 1999, Discret. Math..

Graphs whose Vertex Independence Number is Unaffected by Single Edge Addition of Deletion

Douglas F. Rall, Bert Hartnell, Georg Gunther, 1993, Discret. Appl. Math..

Well-located graphs: a collection of well-covered ones

Bert Hartnell, Art S. Finbow, 2004, Discret. Math..

Limited Packings in Graphs

Douglas F. Rall, Bert Hartnell, Robert P. Gallant, 2008, Electron. Notes Discret. Math..

Improving some bounds for dominating Cartesian products

Douglas F. Rall, Bert Hartnell, 2003, Discuss. Math. Graph Theory.

On well-covered triangulations: Part III

Michael D. Plummer, Richard J. Nowakowski, Bert Hartnell, 2010, Discret. Appl. Math..

On graphs having uniform size star factors

Douglas F. Rall, Bert Hartnell, 2006, Australas. J Comb..

Vizing's conjecture: a survey and recent results

Wayne Goddard, Paul Dorbec, Michael A. Henning, 2012, J. Graph Theory.

On designing a network to defend against random attacks of radius two

Bert Hartnell, Art S. Finbow, 1989, Networks.

A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets

Bert Hartnell, Art S. Finbow, Carol A. Whitehead, 1994, Discret. Math..

On 4-connected Claw-free Well-covered Graphs

Michael D. Plummer, Bert Hartnell, 1996, Discret. Appl. Math..

Well paired-dominated graphs

Bert Hartnell, Shannon L. Fitzpatrick, 2010, J. Comb. Optim..

Well-located graphs: A collection of well-covered ones

Bert Hartnell, Art S. Finbow, 2000, Electron. Notes Discret. Math..

Uniformly dissociated graphs

Douglas F. Rall, Bostjan Bresar, Bert Hartnell, 2017, Ars Math. Contemp..

A characterization of parity graphs containing no cycle of order five or less

Bert Hartnell, Art S. Finbow, 1995, Ars Comb..

Paired-domination

Bert Hartnell, Shannon L. Fitzpatrick, 1998, Discuss. Math. Graph Theory.

On well-covered pentagonalizations of the plane

Michael D. Plummer, Bert Hartnell, Art S. Finbow, 2017, Discret. Appl. Math..

On k-packings of graphs

Bert Hartnell, Carol A. Whitehead, 1997, Ars Comb..

On Graphs Having Maximal Independent Sets of Exactly t Distinct Cardinalities

Douglas F. Rall, Bert Hartnell, 2013, Graphs Comb..

Decycling sets in certain cartesian product graphs with one factor complete

Bert Hartnell, Carol A. Whitehead, 2008, Australas. J Comb..

A note on equimatchable graphs

Preben D. Vestergaard, Bert Hartnell, Allan Frendrup, 2010, Australas. J Comb..

On well-covered triangulations: Part II

Michael D. Plummer, Richard J. Nowakowski, Bert Hartnell, 2009, Discret. Appl. Math..

Characterization of Zm-well-covered graphs for some classes of graphs

Bert Hartnell, Rommel M. Barbosa, 2001, Discret. Math..

Star-factors and k-bounded total domination

Douglas F. Rall, Bert Hartnell, Georg Gunther, 1996, Networks.

On dominating the Cartesian product of a graph and K2

Douglas F. Rall, Bert Hartnell, B. Hartnell, 2004, Discuss. Math. Graph Theory.

Bounds on the bondage number of a graph

Douglas F. Rall, Bert Hartnell, B. Hartnell, 1994, Discret. Math..

On The Local Structure Of Well-Covered Graphs Without 4-Cycles

Bert Hartnell, 1997, Ars Comb..

A linear algorithm for disjoint matchings in trees

Stephen T. Hedetniemi, Bert Hartnell, Ernest J. Cockayne, 1978, Discret. Math..

A characterization of Zm-well-covered graphs of girth 6 or more

Yair Caro, Bert Hartnell, 2000, J. Graph Theory.

On Determining the 2-Packing and Domination Numbers of the Cartesian Product of Certain Graphs

Bert Hartnell, 2000, Ars Comb..