2 citations · 9 across the 16 of their papers we have counts for
16 papers
Infinite families of -vertex-critical (, )-free graphs
Ben Cameron, Chính T. Hoàng
A graph is -vertex-critical if but for all . We construct a new infinite families of -vertex-critical -free graphs for all .…
A refinement on the structure of vertex-critical (, gem)-free graphs
Ben Cameron, Chính T. Hoàng
We give a new, stronger proof that there are only finitely many -vertex-critical (,~gem)-free graphs for all . Our proof further refines the structure of these graphs an…
Vertex-critical -free and vertex-critical (gem, co-gem)-free graphs
Tala Abuadas, Ben Cameron, Chính T. Hoàng +1
A graph is -vertex-critical if but for all where denotes the chromatic number of . We show that there are only finitely many -cr…
Cut-Down de Bruijn Sequences
Ben Cameron, Aysu Gündoğan, Joe Sawada
A cut-down de Bruijn sequence is a cyclic string of length , where , such that every substring of length appears at most once. Etzion [Theor. Comp. Sci 44…
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 such that successive trees differ by pivoting a single edge around a vertex. Such a listing is called a "pivot…
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph
Ben Cameron, Aaron Grubb, Joe Sawada
We use a greedy strategy to list the spanning trees of the fan graph, , such that successive trees differ by pivoting a single edge around a vertex. It is the first greedy alg…