B. Cameron

activity

20172022

most citedOn the Unimodality of Independence Polynomials of Very Well-Covered Graphs

2 citations · 6 across the 9 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

math.CO2022

A refinement on the structure of vertex-critical ( $P_{5}$ , gem)-free graphs

Ben Cameron, Chính T. Hoàng

We give a new, stronger proof that there are only finitely many $k$ -vertex-critical ( $P_{5}$ ,~gem)-free graphs for all $k$ . Our proof further refines the structure of these graphs an…

cs.DS2022

Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan

Ben Cameron, Aaron Grubb, Joe Sawada

We consider the problem of listing all spanning trees of a graph $G$ such that successive trees differ by pivoting a single edge around a vertex. Such a listing is called a "pivot…

A refinement on the structure of vertex-critical (P5​, gem)-free graphs

Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan

A refinement on the structure of vertex-critical ( $P_{5}$ , gem)-free graphs