| On the mean subtree order of graphs under edge addition B Cameron, L Mol Journal of Graph Theory 96 (3), 403-413, 2021 | 14 | 2021 |
| On the unimodality of independence polynomials of very well-covered graphs JI Brown, B Cameron Discrete Mathematics 341 (4), 1138-1143, 2018 | 11 | 2018 |
| A Hamilton Cycle in the k-Sided Pancake Network B Cameron, J Sawada, A Williams Combinatorial Algorithms: 32nd International Workshop, IWOCA 2021, Ottawa …, 2021 | 8 | 2021 |
| On the Stability of Independence Polynomials J Brown, B Cameron The Electronic Journal of Combinatorics 25 (1), #P1.46, 2018 | 8 | 2018 |
| Dichotomizing k-vertex-critical H-free graphs for H of order four B Cameron, CT Hoàng, J Sawada Discrete Applied Mathematics 312, 106-115, 2022 | 7 | 2022 |
| A pivot gray code listing for the spanning trees of the fan graph B Cameron, A Grubb, J Sawada Computing and Combinatorics: 27th International Conference, COCOON 2021 …, 2021 | 6 | 2021 |
| Infinite Families of k-Vertex-Critical (, )-Free Graphs B Cameron, C Hoàng Graphs and Combinatorics 40 (2), 30, 2024 | 5 | 2024 |
| A refinement on the structure of vertex-critical (P5, gem)-free graphs B Cameron, CT Hoàng Theoretical Computer Science 961, 113936, 2023 | 5 | 2023 |
| Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality B Cameron, J Sawada, W Therese, A Williams Algorithmica 85 (3), 717-744, 2023 | 5 | 2023 |
| Maximum modulus of independence roots of graphs and trees JI Brown, B Cameron Graphs and Combinatorics 36 (3), 877-894, 2020 | 5 | 2020 |
| Independence equivalence classes of paths and cycles I Beaton, JI Brown, B Cameron The Australasian Journal of Combinatorics 75 (1), 127-145, 2019 | 5 | 2019 |
| Vertex-critical (P3+ ℓP1)-free and vertex-critical (gem, co-gem)-free graphs T Abuadas, B Cameron, CT Hoàng, J Sawada Discrete Applied Mathematics 344, 179-187, 2024 | 4 | 2024 |
| Edge contraction and cop-win critical graphs B Cameron, S Fitzpatrick Australasian Journal of Combinatorics 63, 70-87, 2015 | 3 | 2015 |
| Cut-down de bruijn sequences B Cameron, A Gündoğan, J Sawada arXiv preprint arXiv:2205.02815, 2022 | 2 | 2022 |
| A note on purely imaginary independence roots JI Brown, B Cameron Discrete Mathematics 343 (12), 112113, 2020 | 2 | 2020 |
| An approximation algorithm for zero forcing B Cameron, J Janssen, R Matthew, Z Zhang arXiv preprint arXiv:2402.08866, 2024 | 1 | 2024 |
| A tight upper bound on the average order of dominating sets of a graph I Beaton, B Cameron arXiv preprint arXiv:2208.10475, 2022 | 1 | 2022 |
| On the finiteness of -vertex-critical -free graphs with forbidden induced squids or bulls M Adekanye, C Bury, B Cameron, T Knodel arXiv preprint arXiv:2402.15908, 2024 | | 2024 |
| The node cop‐win reliability of unicyclic and bicyclic graphs M Ahmed, B Cameron Networks 79 (2), 189-201, 2022 | | 2022 |
| Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan B Cameron, A Grubb, J Sawada arXiv preprint arXiv:2202.01746, 2022 | | 2022 |
Joe SawadaProfessor, Computer Science, University of GuelphVerified email at uoguelph.ca
