19 citations · 73 across the 21 of their papers we have counts for
22 papers
Shorthand Universal Tori for Permutations: Existence, Symmetry, and Generation of Twori
Tim Gerlach, Elizabeth Hartung, Pia Herkenrath +2
A de Bruijn sequence packs all -bit binary words into a cycle of length . A de Bruijn torus is the two-dimensional analogue in which each word appears exactly once in a rec…
Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions
J. Sawada, J. Sears, A. Trautrim +1
Classic cycle-joining techniques have found widespread application in creating universal cycles for a diverse range of combinatorial objects, such as shorthand permutations, weak o…
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…