default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBert L. Hartnell
Person information
- affiliation: Saint Mary's University, Halifax, Nova Scotia, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j49]Arthur S. Finbow
, Bert L. Hartnell, Michael D. Plummer:
A characterization of well-indumatchable graphs having girth greater than seven. Discret. Appl. Math. 321: 261-271 (2022)- 2021
- [j48]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): 749-762 (2021) - 2020
- [j47]Arthur S. Finbow, Bert L. Hartnell, Michael D. Plummer:
On the structure of 4-regular planar well-covered graphs. Discret. Appl. Math. 283: 655-688 (2020)
2010 – 2019
- 2018
- [j46]Bert L. Hartnell, Douglas F. Rall, Kirsti Wash:
On Well-Covered Cartesian Products. Graphs Comb. 34(6): 1259-1268 (2018) - 2017
- [j45]Bostjan Bresar, Bert L. Hartnell, Douglas F. Rall:
Uniformly dissociated graphs. Ars Math. Contemp. 13(2): 293-306 (2017) - [j44]Arthur S. Finbow, Bert L. Hartnell, Michael D. Plummer:
On well-covered pentagonalizations of the plane. Discret. Appl. Math. 224: 91-105 (2017) - 2016
- [j43]Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer:
Well-covered triangulations: Part IV. Discret. Appl. Math. 215: 71-94 (2016) - 2014
- [j42]Bert L. Hartnell, Christina M. Mynhardt:
Independent protection in graphs. Discret. Math. 335: 100-109 (2014) - [j41]Paul Dorbec, Bert L. Hartnell, Michael A. Henning:
Paired versus double domination in K 1, r -free graphs. J. Comb. Optim. 27(4): 688-694 (2014) - 2013
- [j40]Bert L. Hartnell, Douglas F. Rall:
On the Cartesian Product of Non Well-Covered Graphs. Electron. J. Comb. 20(2): 21 (2013) - [j39]Bert L. Hartnell, Douglas F. Rall:
On Graphs Having Maximal Independent Sets of Exactly t Distinct Cardinalities. Graphs Comb. 29(3): 519-525 (2013) - 2012
- [j38]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): 46-76 (2012) - [i1]Bert L. Hartnell, Douglas F. Rall:
On the Cartesian product of non well-covered graphs. CoRR abs/1204.6681 (2012) - 2010
- [j37]Allan Frendrup, Bert L. Hartnell, Preben D. Vestergaard:
A note on equimatchable graphs. Australas. J Comb. 46: 185-190 (2010) - [j36]Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer:
On well-covered triangulations: Part III. Discret. Appl. Math. 158(8): 894-912 (2010) - [j35]Robert P. Gallant, Georg Gunther, Bert L. Hartnell, Douglas F. Rall:
Limited packings in graphs. Discret. Appl. Math. 158(12): 1357-1364 (2010) - [j34]Shannon L. Fitzpatrick, Bert L. Hartnell:
Well paired-dominated graphs. J. Comb. Optim. 20(2): 194-204 (2010)
2000 – 2009
- 2009
- [j33]Art S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer:
On well-covered triangulations: Part II. Discret. Appl. Math. 157(13): 2799-2817 (2009) - 2008
- [j32]Bert L. Hartnell, Carol A. Whitehead:
Decycling sets in certain cartesian product graphs with one factor complete. Australas. J Comb. 40: 305- (2008) - [j31]Robert P. Gallant, Georg Gunther, Bert L. Hartnell, Douglas F. Rall:
Limited Packings in Graphs. Electron. Notes Discret. Math. 30: 15-20 (2008) - 2006
- [j30]Bert L. Hartnell, Douglas F. Rall:
On graphs having uniform size star factors. Australas. J Comb. 34: 305-312 (2006) - 2005
- [j29]Bert L. Hartnell, Preben D. Vestergaard:
Dominating sets with at most k components. Ars Comb. 74 (2005) - 2004
- [j28]E. Boudreau, Bert L. Hartnell, K. Schmeisser, J. Whiteley:
A game based on vertex-magic total labelings. Australas. J Comb. 29: 67-74 (2004) - [j27]Art S. Finbow, Bert L. Hartnell:
Well-located graphs: a collection of well-covered ones. Discret. Math. 276(1-3): 201-209 (2004) - [j26]Bert L. Hartnell, Douglas F. Rall:
On dominating the Cartesian product of a graph and K2. Discuss. Math. Graph Theory 24(3): 389-402 (2004) - 2003
- [j25]Art S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer:
On well-covered triangulations: Part I. Discret. Appl. Math. 132(1-3): 97-108 (2003) - [j24]Bert L. Hartnell, Douglas F. Rall:
Improving some bounds for dominating Cartesian products. Discuss. Math. Graph Theory 23(2): 261-272 (2003) - 2001
- [j23]Rommel M. Barbosa, Bert L. Hartnell:
Characterization of Zm-well-covered graphs for some classes of graphs. Discret. Math. 233(1-3): 293-297 (2001) - 2000
- [j22]Bert L. Hartnell:
On Determining the 2-Packing and Domination Numbers of the Cartesian Product of Certain Graphs. Ars Comb. 55 (2000) - [j21]Art S. Finbow, Bert L. Hartnell:
Well-located graphs: A collection of well-covered ones. Electron. Notes Discret. Math. 5: 120-122 (2000) - [j20]Yair Caro, Bert L. Hartnell:
A characterization of Zm-well-covered graphs of girth 6 or more. J. Graph Theory 33(4): 246-255 (2000)
1990 – 1999
- 1999
- [j19]Bert L. Hartnell, Douglas F. Rall:
A bound on the size of a graph with given order and bondage number. Discret. Math. 197-198: 409-413 (1999) - 1998
- [j18]Shannon L. Fitzpatrick, Bert L. Hartnell:
Paired-domination. Discuss. Math. Graph Theory 18(1): 63-72 (1998) - 1997
- [j17]Bert L. Hartnell:
On The Local Structure Of Well-Covered Graphs Without 4-Cycles. Ars Comb. 45 (1997) - [j16]Bert L. Hartnell, Carol A. Whitehead:
On k-packings of graphs. Ars Comb. 47 (1997) - 1996
- [j15]Bert L. Hartnell, Michael D. Plummer:
On 4-connected Claw-free Well-covered Graphs. Discret. Appl. Math. 64(1): 57-65 (1996) - [j14]Georg Gunther, Bert L. Hartnell, Douglas F. Rall:
Star-factors and k-bounded total domination. Networks 27(3): 197-201 (1996) - 1995
- [j13]Art S. Finbow, Bert L. Hartnell:
A characterization of parity graphs containing no cycle of order five or less. Ars Comb. 40 (1995) - [j12]Bert L. Hartnell, Douglas F. Rall:
Vizing's conjecture and the one-half argument. Discuss. Math. Graph Theory 15(2): 205-216 (1995) - 1994
- [j11]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): 153-167 (1994) - [j10]Bert L. Hartnell, Douglas F. Rall:
Bounds on the bondage number of a graph. Discret. Math. 128(1-3): 173-177 (1994) - [j9]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): 713-721 (1994) - 1993
- [j8]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): 167-172 (1993) - [j7]Art S. Finbow, Bert L. Hartnell, Richard J. Nowakowski:
A Characterization of Well Covered Graphs of Girth 5 or Greater. J. Comb. Theory B 57(1): 44-68 (1993) - 1991
- [j6]Bert L. Hartnell, William L. Kocay:
On minimal neighbourhood-connected graphs. Discret. Math. 92(1-3): 95-105 (1991)
1980 – 1989
- 1989
- [j5]Art S. Finbow, Bert L. Hartnell:
On designing a network to defend against random attacks of radius two. Networks 19(7): 771-792 (1989) - 1987
- [j4]Georg Gunther, Bert L. Hartnell, Richard J. Nowakowski:
Neighbor-connected graphs and projective planes. Networks 17(2): 241-247 (1987) - 1980
- [j3]Georg Gunther, Bert L. Hartnell:
Optimal K-secure graphs. Discret. Appl. Math. 2(3): 225-231 (1980)
1970 – 1979
- 1978
- [j2]Ernest J. Cockayne, Bert L. Hartnell, Stephen T. Hedetniemi:
A linear algorithm for disjoint matchings in trees. Discret. Math. 21(2): 129-136 (1978) - 1977
- [j1]Ernest J. Cockayne, Bert L. Hartnell:
Edge partitions of complete multipartite graphs into equal length circuits. J. Comb. Theory B 23(2-3): 174-183 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
