| A characterization of well covered graphs of girth 5 or greater A Finbow, B Hartnell, RJ Nowakowski Journal of Combinatorial Theory, Series B 57 (1), 44-68, 1993 | 178 | 1993 |
| Firefighter! an application of domination B Hartnell the 24th Manitoba Conference on Combinatorial Mathematics and Computing …, 1995 | 172 | 1995 |
| Vizing's conjecture: a survey and recent results B Breąar, P Dorbec, W Goddard, BL Hartnell, MA Henning, S Klavľar, ... Journal of Graph Theory 69 (1), 46-76, 2012 | 159 | 2012 |
| Bounds on the bondage number of a graph BL Hartnell, DF Rall Discrete Mathematics 128 (1-3), 173-177, 1994 | 116 | 1994 |
| Domination in Cartesian products: Vizing’s conjecture B Hartnell, DF Rall Domination in graphs, 163-190, 2017 | 98 | 2017 |
| A characterization of well‐covered graphs that contain neither 4‐nor 5‐cycles A Finbow, B Hartnell, RJ Nowakowski Journal of Graph Theory 18 (7), 713-721, 1994 | 94 | 1994 |
| Firefighting on trees: how bad is the greedy algorithm? B Hartnell Congressus Numerantium 145, 187-192, 2000 | 90 | 2000 |
| Perfect domination in graphs EJ Cockayne, BL Hartnell, ST Hedetniemi, R Laskar J. Combin. Inform. System Sci 18 (1-2), 136-148, 1993 | 83 | 1993 |
| On dominating the Cartesian product of a graph and K₂ B Hartnell, D Rall Discussiones Mathematicae Graph Theory 24 (3), 389-402, 2004 | 81 | 2004 |
| On locating dominating sets and well-covered graphs A Finbow, BL Hartnell Congr. Numer 65 (1988), 191-200, 1988 | 76 | 1988 |
| Well-located graphs: a collection of well-covered ones AS Finbow, BL Hartnell Discrete mathematics 276 (1-3), 201-209, 2004 | 75 | 2004 |
| Graphs with unique minimum dominating sets G Gunther, B Hartnell, LR Markus, D Rall Congressus Numerantium, 55-64, 1994 | 75 | 1994 |
| Limited packings in graphs R Gallant, G Gunther, BL Hartnell, DF Rall Discrete Applied Mathematics 158 (12), 1357-1364, 2010 | 66 | 2010 |
| On minimizing the effects of betrayals in a resistance movement G Gunther, BL Hartnell Proc. Eighth Manitoba Conference on Numerical Mathematics and Computing, 285-306, 1978 | 54 | 1978 |
| A game related to covering by stars AS Finbow, BL Hartnell Ars Combinatoria 16, 189-198, 1983 | 52 | 1983 |
| Graphs whose vertex independence number is unaffected by single edge addition or deletion G Gunther, B Hartnell, DF Rall Discrete Applied Mathematics 46 (2), 167-172, 1993 | 51 | 1993 |
| Well-covered graphs BL Hartnell Journal of Combinatorial Mathematics and Combinatorial Computing 29, 107-116, 1999 | 48 | 1999 |
| A characterization of trees in which no edge is essential to the domination number BL Hartnell Ars Combin. 33, 65-76, 1992 | 47 | 1992 |
| On Vizing's conjecture BL Hartnell, DF Rall Congressus Numerantium, 87-87, 1991 | 41 | 1991 |
| Paired-domination S Fitzpatrick, B Hartnell Discussiones Mathematicae Graph Theory 18 (1), 63-72, 1998 | 40 | 1998 |
