Cover Image

Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sawada, J., Sears, J., Trautrim, A., Williams, A.
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
by: Sawada, Joe, et al.
Published: (2025)

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
by: Gabric, Daniel, et al.
Published: (2026)

Universal cycle constructions for k-subsets and k-multisets
by: Campbell, Colin, et al.
Published: (2026)

On de Bruijn Rings and Families of Almost Perfect Maps
by: Stelldinger, Peer
Published: (2024)

Splitting vertices of bipartite graphs preserves de Bruijn-Erdős property
by: Beaudou, Laurent, et al.
Published: (2025)

Onion De Bruijn Sequences: Fixed-Window Counting by Growing the Alphabet
by: Genosar, Dor, et al.
Published: (2019)

On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)

Planar cycle-extendable graphs
by: Dalwadi, Aditya Y, et al.
Published: (2024)

Non-detectable patterns hidden within sequences of bits
by: Allen, David, et al.
Published: (2024)

A note on embracing exchange sequences in oriented matroids
by: Bérczi, Kristóf, et al.
Published: (2025)

Facial diagrams and cycle double cover
by: Ghanbari, Babak, et al.
Published: (2026)

Satisfying sequences for rainbow partite matchings
by: Kupavskii, Andrey, et al.
Published: (2025)

Basis sequence reconfiguration in the union of matroids
by: Hanaka, Tesshu, et al.
Published: (2024)

Construction of orientable sequences in $O(1)$-amortized time per bit
by: Gabric, Daniel, et al.
Published: (2024)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)

Redicolouring digraphs: directed treewidth and cycle-degeneracy
by: Nisse, Nicolas, et al.
Published: (2023)

Dividing sums of cycles in the semiring of functional digraphs
by: Bridoux, Florian, et al.
Published: (2025)

Erdős--Pósa property of cycles that are far apart
by: Dujmović, Vida, et al.
Published: (2024)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
by: Claus, Quentin, et al.
Published: (2026)

A complete $t$-intersection theorem for families of spanning trees
by: Iarovikova, Elizaveta, et al.
Published: (2025)

Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
by: Gabrić, Daniel, et al.
Published: (2024)

How to see the forest for the trees
by: Bérczi-Kovács, Erika, et al.
Published: (2025)

A new proof of Delahan's induced-universality result
by: Chappelon, Jonathan
Published: (2026)

Bounds on treewidth via excluding disjoint unions of cycles
by: Hatzel, Meike, et al.
Published: (2025)

Unavoidable butterfly minors in digraphs of large cycle rank
by: Hatzel, Meike, et al.
Published: (2025)

On the existence of factors intersecting sets of cycles in regular graphs
by: Goedgebeur, Jan, et al.
Published: (2024)

tinygarden -- A java package for testing properties of spanning trees
by: Dubinsky, Manuel, et al.
Published: (2024)

Labeling and folding multi-labeled trees
by: Moulton, Vincent, et al.
Published: (2025)

Computational complexity of covering regular trees
by: Bok, Jan, et al.
Published: (2025)

Conflict-free chromatic index of trees
by: Guo, Shanshan, et al.
Published: (2024)

Separating the edges of a graph by cycles and by subdivisions of $K_4$
by: Botler, Fábio, et al.
Published: (2024)

EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)

Tree-partitions and small-spread tree-decompositions
by: Distel, Marc, et al.
Published: (2026)

On coarse tree decompositions and coarse balanced separators
by: Abrishami, Tara, et al.
Published: (2025)

Bipartite Turán number of paths and other trees
by: Bonamy, Marthe, et al.
Published: (2025)

Exact rainbow numbers of cycle-related graphs in multi-hubbed wheels
by: Dai, Mengyao, et al.
Published: (2025)

Trade-off between spread and width for tree decompositions
by: Bodlaender, Hans L., et al.
Published: (2026)

Listing spanning trees of outerplanar graphs by pivot-exchanges
by: Behrooznia, Nastaran, et al.
Published: (2024)

Induced matching treewidth and tree-independence number, revisited
by: Alon, Noga, et al.
Published: (2025)

Tight bound for the Erdős-Pósa property of tree minors
by: Dujmović, Vida, et al.
Published: (2024)