| The 1-2-3 conjecture and related problems: a survey B Seamone arXiv preprint arXiv:1211.5122, 2012 | 121* | 2012 |
| π/2-Angle Yao graphs are spanners P Bose, M Damian, K Douieb, J O’Rourke, B Seamone, M Smid, S Wuhrer Algorithms and Computation, 446-457, 2010 | 58* | 2010 |
| Independent dominating sets and Hamiltonian cycles P Haxell, B Seamone, J Verstraete Journal of Graph Theory 54 (3), 233-244, 2007 | 51 | 2007 |
| Vertex-colouring edge-weightings with two edge weights M Khatirinejad, R Naserasr, M Newman, B Seamone, B Stevens Discrete Mathematics and Theoretical Computer Science 14 (1), 1-20, 2012 | 33 | 2012 |
| Digraphs are 2-weight choosable M Khatirinejad, R Naserasr, M Newman, B Seamone, B Stevens Electron. J. Combin 18 (1), 2011 | 19 | 2011 |
| Fully active cops and robbers I Gromovikov, WB Kinnersley, B Seamone arXiv preprint arXiv:1808.06734, 2018 | 13 | 2018 |
| Bounding the monomial index and (1, l)-weight choosability of a graph B Seamone Discrete Mathematics & Theoretical Computer Science 16 (3), 173-188, 2014 | 13* | 2014 |
| A study of cops and robbers in oriented graphs D Khatri, N Komarov, A Krim-Yee, N Kumar, B Seamone, V Virgile, AQ Xu arXiv preprint arXiv:1811.06155, 2018 | 12 | 2018 |
| Sequence variations of the 1-2-3 conjecture and irregularity strength B Seamone, B Stevens Discrete Mathematics & Theoretical Computer Science 15 (Graph Theory), 2013 | 12 | 2013 |
| Hamiltonian chordal graphs are not cycle extendable M Lafond, B Seamone SIAM Journal on Discrete Mathematics 29 (2), 877-887, 2015 | 11 | 2015 |
| A method for eternally dominating strong grids A Gagnon, A Hassler, J Huang, A Krim-Yee, F Mc Inerney, A Zacarías, ... Inria-Sophia Antipolis, 2019 | 8 | 2019 |
| The 1-2-3 Conjecture and related problems: a survey. Preprint (2012) B Seamone arXiv preprint arXiv:1211.5122, 0 | 7 | |
| On uniquely Hamiltonian claw-free and triangle-free graphs B Seamone Discussiones Mathematicae Graph Theory 35 (2), 207-214, 2015 | 6 | 2015 |
| Derived colourings of graphs BD Seamone Carleton University, 2012 | 6 | 2012 |
| Few hamiltonian cycles in graphs with one or two vertex degrees J Goedgebeur, J Jooken, OHS Lo, B Seamone, C Zamfirescu Mathematics of Computation 93 (350), 3059-3082, 2024 | 5 | 2024 |
| Edge clique covers in graphs with independence number two P Charbit, G Hahn, M Kamiński, M Lafond, N Lichiardopol, R Naserasr, ... Journal of graph theory 97 (2), 324-339, 2021 | 5 | 2021 |
| Eternal domination on prisms of graphs A Krim-Yee, B Seamone, V Virgile Discrete Applied Mathematics 283, 734-736, 2020 | 4 | 2020 |
| Spanning trees with specified differences in Cayley graphs B Seamone, B Stevens Discrete Mathematics 312 (17), 2561-2565, 2012 | 4 | 2012 |
| Fractional eternal domination: securely distributing resources across a network F Devvrit, A Krim-Yee, N Kumar, G MacGillivray, B Seamone, V Virgile, ... arXiv preprint arXiv:2304.11795, 2023 | 3 | 2023 |
| The speed and threshold of the biased perfect matching game N Brustle, S Clusiau, VV Narayan, N Ndiaye, B Reed, B Seamone Procedia Computer Science 195, 190-199, 2021 | 2 | 2021 |
Nithish KumarPurdue UniversityVerified email at purdue.edu
