| Identifying graph automorphisms using determining sets DL Boutin the electronic journal of combinatorics, R78-R78, 2006 | 108 | 2006 |
| Using determining sets to distinguish Kneser graphs MO Albertson, DL Boutin the electronic journal of combinatorics 14 (1), R20, 2007 | 57 | 2007 |
| The determining number of a Cartesian product DL Boutin Journal of Graph Theory 61 (2), 77-87, 2009 | 51 | 2009 |
| Determining sets, resolving sets, and the exchange property DL Boutin Graphs and Combinatorics 25 (6), 789-806, 2009 | 34 | 2009 |
| Small label classes in 2-distinguishing labelings. DL Boutin Ars Math. Contemp. 1 (2), 154-164, 2008 | 25 | 2008 |
| Thickness‐two graphs part one: New nine‐critical graphs, permuted layer graphs, and Catlin's graphs DL Boutin, E Gethner, T Sulanke Journal of Graph Theory 57 (3), 198-214, 2008 | 17 | 2008 |
| The cost of 2-distinguishing Cartesian powers D Boutin the electronic journal of combinatorics 20 (1), P74, 2013 | 15 | 2013 |
| The thickness and chromatic number of r-inflated graphs MO Albertson, DL Boutin, E Gethner Discrete mathematics 310 (20), 2725-2734, 2010 | 14 | 2010 |
| Automorphisms and distinguishing numbers of geometric cliques MO Albertson, DL Boutin Discrete & Computational Geometry 39, 778-785, 2008 | 11 | 2008 |
| Distinguishing geometric graphs MO Albertson, DL Boutin Journal of Graph Theory 53 (2), 135-150, 2006 | 11 | 2006 |
| The cost of distinguishing graphs D Boutin, W Imrich Groups, graphs and random walks. London Mathematical Society Lecture Note …, 2017 | 10 | 2017 |
| The cost of 2-distinguishing selected Kneser graphs and hypercubes DL Boutin J. Combin. Math. Combin. Comput 85, 161-171, 2013 | 10 | 2013 |
| Geometric graph homomorphisms DL Boutin, S Cockburn Journal of Graph Theory 69 (2), 97-113, 2012 | 8 | 2012 |
| More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number. MO Albertson, DL Boutin, E Gethner Ars Math. Contemp. 4 (1), 5-24, 2011 | 8 | 2011 |
| Realizing finite groups in Euclidean space MO Albertson, DL Boutin Journal of Algebra 225 (2), 947-956, 2000 | 8 | 2000 |
| Posets of geometric graphs DL Boutin, S Cockburn, A Dean, A Margea arXiv preprint arXiv:1107.1131, 2011 | 7 | 2011 |
| Determining number and cost of generalized Mycielskian graphs D Boutin, S Cockburn, L Keough, S Loeb, KE Perry, P Rombach Discussiones Mathematicae Graph Theory, 2020 | 6 | 2020 |
| Identifying codes on directed de Bruijn graphs D Boutin, VH Goliber, M Pelto Discrete Applied Mathematics 262, 29-41, 2019 | 6 | 2019 |
| Infinite graphs with finite 2-distinguishing cost D Boutin, W Imrich The electronic journal of combinatorics, P4. 52-P4. 52, 2014 | 6 | 2014 |
| Lower bounds for constant degree independent sets MO Albertson, DL Boutin Discrete Mathematics 127 (1-3), 15-21, 1994 | 6 | 1994 |
