 | 2009 |
| 19 |  | 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 |
| 18 |  | Robert Gallant,
Georg Gunther,
Bert Hartnell,
Douglas F. Rall:
Limited Packings in Graphs.
Electronic Notes in Discrete Mathematics 30: 15-20 (2008) |
| 2005 |
| 17 |  | Bert Hartnell,
Preben D. Vestergaard:
Dominating sets with at most k components.
Ars Comb. 74: (2005) |
| 2004 |
| 16 |  | Art S. Finbow,
Bert Hartnell:
Well-located graphs: a collection of well-covered ones.
Discrete Mathematics 276(1-3): 201-209 (2004) |
| 2003 |
| 15 |  | 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) |
| 2001 |
| 14 |  | Rommel Barbosa,
Bert Hartnell:
Characterization of Zm-well-covered graphs for some classes of graphs.
Discrete Mathematics 233(1-3): 293-297 (2001) |
| 2000 |
| 13 |  | Bert Hartnell:
On Determining the 2-Packing and Domination Numbers of the Cartesian Product of Certain Graphs.
Ars Comb. 55: (2000) |
| 12 |  | Art S. Finbow,
Bert Hartnell:
Well-located graphs: A collection of well-covered ones.
Electronic Notes in Discrete Mathematics 5: 120-122 (2000) |
| 1999 |
| 11 |  | 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) |
| 1997 |
| 10 |  | Bert Hartnell:
On The Local Structure Of Well-Covered Graphs Without 4-Cycles.
Ars Comb. 45: (1997) |
| 9 |  | Bert Hartnell,
Carol Whitehead:
On k-packings of graphs.
Ars Comb. 47: (1997) |
| 1996 |
| 8 |  | Bert Hartnell,
Michael D. Plummer:
On 4-connected Claw-free Well-covered Graphs.
Discrete Applied Mathematics 64(1): 57-65 (1996) |
| 7 |  | Georg Gunther,
Bert Hartnell,
Douglas F. Rall:
Star-factors and k-bounded total domination.
Networks 27(3): 197-201 (1996) |
| 1994 |
| 6 |  | 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) |
| 5 |  | Bert Hartnell,
Douglas F. Rall:
Bounds on the bondage number of a graph.
Discrete Mathematics 128(1-3): 173-177 (1994) |
| 1993 |
| 4 |  | 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) |
| 3 |  | 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 |
| 2 |  | Bert Hartnell,
William Kocay:
On minimal neighbourhood-connected graphs.
Discrete Mathematics 92(1-3): 95-105 (1991) |
| 1977 |
| 1 |  | 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) |