关注
Ben Cameron
Ben Cameron
在 upei.ca 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
On the mean subtree order of graphs under edge addition
B Cameron, L Mol
Journal of Graph Theory 96 (3), 403-413, 2021
142021
On the unimodality of independence polynomials of very well-covered graphs
JI Brown, B Cameron
Discrete Mathematics 341 (4), 1138-1143, 2018
112018
A Hamilton Cycle in the k-Sided Pancake Network
B Cameron, J Sawada, A Williams
Combinatorial Algorithms: 32nd International Workshop, IWOCA 2021, Ottawa …, 2021
102021
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
82022
On the Stability of Independence Polynomials
J Brown, B Cameron
The Electronic Journal of Combinatorics 25 (1), #P1.46, 2018
82018
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
72021
A refinement on the structure of vertex-critical (P5, gem)-free graphs
B Cameron, CT Hoàng
Theoretical Computer Science 961, 113936, 2023
62023
Infinite Families of k-Vertex-Critical (, )-Free Graphs
B Cameron, C Hoàng
Graphs and Combinatorics 40 (2), 30, 2024
52024
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
52024
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
52023
Maximum modulus of independence roots of graphs and trees
JI Brown, B Cameron
Graphs and Combinatorics 36 (3), 877-894, 2020
52020
Independence equivalence classes of paths and cycles
I Beaton, JI Brown, B Cameron
The Australasian Journal of Combinatorics 75 (1), 127-145, 2019
52019
Cut-down de bruijn sequences
B Cameron, A Gündoğan, J Sawada
Discrete Mathematics 348 (1), 114204, 2025
32025
Edge contraction and cop-win critical graphs
B Cameron, S Fitzpatrick
Australasian Journal of Combinatorics 63, 70-87, 2015
32015
A note on purely imaginary independence roots
JI Brown, B Cameron
Discrete Mathematics 343 (12), 112113, 2020
22020
Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan
B Cameron, A Grubb, J Sawada
Graphs and Combinatorics 40 (4), 78, 2024
12024
An approximation algorithm for zero forcing
B Cameron, J Janssen, R Matthew, Z Zhang
arXiv preprint arXiv:2402.08866, 2024
12024
A tight upper bound on the average order of dominating sets of a graph
I Beaton, B Cameron
Journal of Graph Theory, 2022
12022
Vertex-critical graphs in co-gem-free graphs
I Beaton, B Cameron
arXiv preprint arXiv:2408.05027, 2024
2024
On the Finiteness of k-Vertex-Critical -Free Graphs with Forbidden Induced Squids or Bulls
M Adekanye, C Bury, B Cameron, T Knodel
International Workshop on Combinatorial Algorithms, 301-313, 2024
2024
系统目前无法执行此操作,请稍后再试。
文章 1–20