Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Bert Hartnell
2010 – today
- 2013
[j33]Bert Hartnell, Douglas F. Rall: On the Cartesian Product of Non Well-Covered Graphs. Electr. J. Comb. 20(2): P21 (2013)- [j32]Bert Hartnell, Douglas F. Rall: On Graphs Having Maximal Independent Sets of Exactly t Distinct Cardinalities. Graphs and Combinatorics 29(3): 519-525 (2013)
- 2012
- [j31]Bostjan Bresar, Paul Dorbec, Wayne Goddard, Bert Hartnell, Michael A. Henning, Sandi Klavzar, Douglas F. Rall: Vizing's conjecture: a survey and recent results. Journal of Graph Theory 69(1): 46-76 (2012)
- [i1]Bert Hartnell, Douglas F. Rall: On the Cartesian product of non well-covered graphs. CoRR abs/1204.6681 (2012)
- 2010
- [j30]Arthur S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer: On well-covered triangulations: Part III. Discrete Applied Mathematics 158(8): 894-912 (2010)
- [j29]Robert Gallant, Georg Gunther, Bert Hartnell, Douglas F. Rall: Limited packings in graphs. Discrete Applied Mathematics 158(12): 1357-1364 (2010)
- [j28]Shannon L. Fitzpatrick, Bert Hartnell: Well paired-dominated graphs. J. Comb. Optim. 20(2): 194-204 (2010)
2000 – 2009
- 2009
- [j27]Art S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer: On well-covered triangulations: Part II. Discrete Applied Mathematics 157(13): 2799-2817 (2009)
- 2008
- [j26]Robert Gallant, Georg Gunther, Bert Hartnell, Douglas F. Rall: Limited Packings in Graphs. Electronic Notes in Discrete Mathematics 30: 15-20 (2008)
- 2005
- [j25]Bert Hartnell, Preben D. Vestergaard: Dominating sets with at most k components. Ars Comb. 74 (2005)
- 2004
- [j24]Art S. Finbow, Bert Hartnell: Well-located graphs: a collection of well-covered ones. Discrete Mathematics 276(1-3): 201-209 (2004)
- [j23]Bert Hartnell, Douglas F. Rall: On dominating the Cartesian product of a graph and K2. Discussiones Mathematicae Graph Theory 24(3): 389-402 (2004)
- 2003
- [j22]Art S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer: On well-covered triangulations: Part I. Discrete Applied Mathematics 132(1-3): 97-108 (2003)
- [j21]Bert Hartnell, Douglas F. Rall: Improving some bounds for dominating Cartesian products. Discussiones Mathematicae Graph Theory 23(2): 261-272 (2003)
- 2001
- [j20]Rommel Barbosa, Bert Hartnell: Characterization of Zm-well-covered graphs for some classes of graphs. Discrete Mathematics 233(1-3): 293-297 (2001)
- 2000
- [j19]Bert Hartnell: On Determining the 2-Packing and Domination Numbers of the Cartesian Product of Certain Graphs. Ars Comb. 55 (2000)
- [j18]Art S. Finbow, Bert Hartnell: Well-located graphs: A collection of well-covered ones. Electronic Notes in Discrete Mathematics 5: 120-122 (2000)
- [j17]Yair Caro, Bert Hartnell: A characterization of Zm-well-covered graphs of girth 6 or more. Journal of Graph Theory 33(4): 246-255 (2000)
1990 – 1999
- 1999
- [j16]Bert Hartnell, Douglas F. Rall: A bound on the size of a graph with given order and bondage number. Discrete Mathematics 197-198: 409-413 (1999)
- 1998
- [j15]Shannon L. Fitzpatrick, Bert Hartnell: Paired-domination. Discussiones Mathematicae Graph Theory 18(1): 63-72 (1998)
- 1997
- [j14]
- [j13]
- 1996
- [j12]Bert Hartnell, Michael D. Plummer: On 4-connected Claw-free Well-covered Graphs. Discrete Applied Mathematics 64(1): 57-65 (1996)
- [j11]Georg Gunther, Bert Hartnell, Douglas F. Rall: Star-factors and k-bounded total domination. Networks 27(3): 197-201 (1996)
- 1995
- [j10]Bert Hartnell, Douglas F. Rall: Vizing's conjecture and the one-half argument. Discussiones Mathematicae Graph Theory 15(2): 205-216 (1995)
- 1994
- [j9]Art S. Finbow, Bert Hartnell, Carol Whitehead: A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets. Discrete Mathematics 125(1-3): 153-167 (1994)
- [j8]Bert Hartnell, Douglas F. Rall: Bounds on the bondage number of a graph. Discrete Mathematics 128(1-3): 173-177 (1994)
- [j7]Art Stephen Finbow, Bert Hartnell, Richard J. Nowakowski: A characterization of well-covered graphs that contain neither 4- nor 5-cycles. Journal of Graph Theory 18(7): 713-721 (1994)
- 1993
- [j6]Georg Gunther, Bert Hartnell, Douglas F. Rall: Graphs whose Vertex Independence Number is Unaffected by Single Edge Addition of Deletion. Discrete Applied Mathematics 46(2): 167-172 (1993)
- [j5]Art S. Finbow, Bert Hartnell, Richard J. Nowakowski: A Characterization of Well Covered Graphs of Girth 5 or Greater. J. Comb. Theory, Ser. B 57(1): 44-68 (1993)
- 1991
- [j4]Bert Hartnell, William Kocay: On minimal neighbourhood-connected graphs. Discrete Mathematics 92(1-3): 95-105 (1991)
1980 – 1989
- 1989
- [j3]Art S. Finbow, Bert Hartnell: On designing a network to defend against random attacks of radius two. Networks 19(7): 771-792 (1989)
- 1987
- [j2]Georg Gunther, Bert Hartnell, Richard J. Nowakowski: Neighbor-connected graphs and projective planes. Networks 17(2): 241-247 (1987)
1970 – 1979
- 1977
- [j1]Ernest J. Cockayne, Bert Hartnell: Edge partitions of complete multipartite graphs into equal length circuits. J. Comb. Theory, Ser. B 23(2-3): 174-183 (1977)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-14 22:39 CEST by the dblp team