Ben Cameron

Publication Activity (10 Years)

Years Active: 2015-2025
Publications (10 Years): 28

Top Topics

Independence Assumption

Graph Theoretic

Top Venues

Discret. Appl. Math.

Publications

Ben Cameron, Aysu Gündogan, Joe Sawada
Cut-down de Bruijn sequences. Discret. Math. 348 (1) (2025)
Tala Abuadas, Ben Cameron, Chính T. Hoàng, Joe Sawada
Vertex-critical (P3+ℓP1)-free and vertex-critical (gem, co-gem)-free graphs. Discret. Appl. Math. 344 (2024)
Ben Cameron, Aaron Grubb, Joe Sawada
Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan. Graphs Comb. 40 (4) (2024)
Melvin Adekanye, Christopher Bury, Ben Cameron, Thaler Knodel
-free graphs with forbidden induced squids or bulls. CoRR (2024)
Melvin Adekanye, Christopher Bury, Ben Cameron, Thaler Knodel
-Free Graphs with Forbidden Induced Squids or Bulls. IWOCA (2024)
Ben Cameron, Chính T. Hoàng
)-Free Graphs. Graphs Comb. 40 (2) (2024)
Ben Cameron, Joe Sawada, Wei Therese, Aaron Williams
Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality. Algorithmica 85 (3) (2023)
Ben Cameron, Chính T. Hoàng
, gem)-free graphs. Theor. Comput. Sci. 961 (2023)
Ben Cameron, Chính T. Hoàng
)-free graphs. CoRR (2023)
Ben Cameron, Aysu Gündogan, Joe Sawada
Cut-Down de Bruijn Sequences. CoRR (2022)
Ben Cameron, Chính T. Hoàng, Joe Sawada
Dichotomizing k-vertex-critical H-free graphs for H of order four. Discret. Appl. Math. 312 (2022)
Ben Cameron, Aaron Grubb, Joe Sawada
Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan. CoRR (2022)
Ben Cameron, Chính T. Hoàng
, gem)-free graphs. CoRR (2022)
Tala Abuadas, Ben Cameron, Chính T. Hoàng, Joe Sawada
)-free and vertex-critical (gem, co-gem)-free graphs. CoRR (2022)
Maimoonah Ahmed, Ben Cameron
The node cop-win reliability of unicyclic and bicyclic graphs. Networks 79 (2) (2022)
Iain Beaton, Ben Cameron
A Tight Upper Bound on the Average Order of Dominating Sets of a Graph. CoRR (2022)
Ben Cameron, Aaron Grubb, Joe Sawada
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph. COCOON (2021)
Ben Cameron, Aaron Grubb, Joe Sawada
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph. CoRR (2021)
Ben Cameron, Joe Sawada, Aaron Williams
A Hamilton Cycle in the k-Sided Pancake Network. IWOCA (2021)
Ben Cameron, Joe Sawada, Aaron Williams
A Hamilton Cycle in the k-Sided Pancake Network. CoRR (2021)
Ben Cameron, Lucas Mol
On the mean subtree order of graphs under edge addition. J. Graph Theory 96 (3) (2021)
Jason I. Brown, Ben Cameron
A note on purely imaginary independence roots. Discret. Math. 343 (12) (2020)
Ben Cameron, Chính T. Hoàng, Joe Sawada
Dichotomizing k-vertex-critical H-free graphs for H of order four. CoRR (2020)
Jason I. Brown, Ben Cameron
Maximum Modulus of Independence Roots of Graphs and Trees. Graphs Comb. 36 (3) (2020)
Iain Beaton, Jason I. Brown, Ben Cameron
Independence equivalence classes of paths and cycles. Australas. J Comb. 75 (2019)
Jason I. Brown, Ben Cameron
On the Stability of Independence Polynomials. Electron. J. Comb. 25 (1) (2018)
Jason I. Brown, Ben Cameron
On the unimodality of independence polynomials of very well-covered graphs. Discret. Math. 341 (4) (2018)
Ben Cameron, Shannon L. Fitzpatrick
Edge contraction and cop-win critical graphs. Australas. J Comb. 63 (2015)