Bert L. Hartnell

Orcid: 0000-0002-0823-0834

Affiliations:
  • Saint Mary's University, Halifax, Nova Scotia, Canada


According to our database1, Bert L. Hartnell authored at least 47 papers between 1977 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A characterization of well-indumatchable graphs having girth greater than seven.
Discret. Appl. Math., 2022

2021
A new framework to approach Vizing's conjecture.
Discuss. Math. Graph Theory, 2021

2020
On the structure of 4-regular planar well-covered graphs.
Discret. Appl. Math., 2020

2018
On Well-Covered Cartesian Products.
Graphs Comb., 2018

2017
On well-covered pentagonalizations of the plane.
Discret. Appl. Math., 2017

Uniformly dissociated graphs.
Ars Math. Contemp., 2017

2016
Well-covered triangulations: Part IV.
Discret. Appl. Math., 2016

2014
Paired versus double domination in K 1, r -free graphs.
J. Comb. Optim., 2014

Independent protection in graphs.
Discret. Math., 2014

2013
On Graphs Having Maximal Independent Sets of Exactly t Distinct Cardinalities.
Graphs Comb., 2013

On the Cartesian Product of Non Well-Covered Graphs.
Electron. J. Comb., 2013

2012
Vizing's conjecture: a survey and recent results.
J. Graph Theory, 2012

2010
Well paired-dominated graphs.
J. Comb. Optim., 2010

On well-covered triangulations: Part III.
Discret. Appl. Math., 2010

A note on equimatchable graphs.
Australas. J Comb., 2010

2009
On well-covered triangulations: Part II.
Discret. Appl. Math., 2009

2008
Limited Packings in Graphs.
Electron. Notes Discret. Math., 2008

Decycling sets in certain cartesian product graphs with one factor complete.
Australas. J Comb., 2008

2006
On graphs having uniform size star factors.
Australas. J Comb., 2006

2005
Dominating sets with at most k components.
Ars Comb., 2005

2004
On dominating the Cartesian product of a graph and <i>K<sub>2</sub></i>.
Discuss. Math. Graph Theory, 2004

A game based on vertex-magic total labelings.
Australas. J Comb., 2004

2003
Improving some bounds for dominating Cartesian products.
Discuss. Math. Graph Theory, 2003

On well-covered triangulations: Part I.
Discret. Appl. Math., 2003

2001
Characterization of <i>Z</i><sub>m</sub>-well-covered graphs for some classes of graphs.
Discret. Math., 2001

2000
A characterization of Z<sub>m</sub>-well-covered graphs of girth 6 or more.
J. Graph Theory, 2000

Well-located graphs: A collection of well-covered ones.
Electron. Notes Discret. Math., 2000

On Determining the 2-Packing and Domination Numbers of the Cartesian Product of Certain Graphs.
Ars Comb., 2000

1999
A bound on the size of a graph with given order and bondage number.
Discret. Math., 1999

1998
Paired-domination.
Discuss. Math. Graph Theory, 1998

1997
On k-packings of graphs.
Ars Comb., 1997

On The Local Structure Of Well-Covered Graphs Without 4-Cycles.
Ars Comb., 1997

1996
Star-factors and k-bounded total domination.
Networks, 1996

On 4-connected Claw-free Well-covered Graphs.
Discret. Appl. Math., 1996

1995
Vizing's conjecture and the one-half argument.
Discuss. Math. Graph Theory, 1995

A characterization of parity graphs containing no cycle of order five or less.
Ars Comb., 1995

1994
A characterization of well-covered graphs that contain neither 4- nor 5-cycles.
J. Graph Theory, 1994

Bounds on the bondage number of a graph.
Discret. Math., 1994

A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets.
Discret. Math., 1994

1993
A Characterization of Well Covered Graphs of Girth 5 or Greater.
J. Comb. Theory, Ser. B, 1993

Graphs whose Vertex Independence Number is Unaffected by Single Edge Addition of Deletion.
Discret. Appl. Math., 1993

1991
On minimal neighbourhood-connected graphs.
Discret. Math., 1991

1989
On designing a network to defend against random attacks of radius two.
Networks, 1989

1987
Neighbor-connected graphs and projective planes.
Networks, 1987

1980
Optimal K-secure graphs.
Discret. Appl. Math., 1980

1978
A linear algorithm for disjoint matchings in trees.
Discret. Math., 1978

1977
Edge partitions of complete multipartite graphs into equal length circuits.
J. Comb. Theory, Ser. B, 1977


  Loading...