19 citations · 73 across the 21 of their papers we have counts for
10 papers · 1 filter
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…
Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order
Joe Sawada, Aaron Williams, Dennis Wong
A flip-swap language is a set S of binary strings of length n such that is closed under two operations (when applicable): (1) Flip the leftmost 1; and (2) Swap the lef…
A Hamilton Cycle in the -Sided Pancake Network
Ben Cameron, Joe Sawada, Aaron Williams
We present a Hamilton cycle in the -sided pancake network and four combinatorial algorithms to traverse the cycle. The network's vertices are coloured permutations $π= p_1p_2\cd…
Dichotomizing -vertex-critical -free graphs for of order four
Ben Cameron, Chính T. Hoàng, Joe Sawada
For , we prove (i) there is a finite number of -vertex-critical -free graphs and (ii) -vertex-critical -free graphs have at most v…