Abstract: A universal cycle is a compact listing of a class of combinatorial objects. In this paper, we prove the existence of universal cycles of classes of labeled graphs, including simple graphs, trees, graphs with m edges, graphs with loops, graphs with multiple edges (with up to m duplications of each edge), directed graphs, hypergraphs, and k-uniform hypergraphs.
Recommendations
Cited in
(11)- Binary bubble languages and cool-lex order
- The lexicographically smallest universal cycle for binary strings with minimum specified weight
- Universal cycles of restriced words
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
- Universal and overlap cycles for posets, words, and juggling patterns
- Graph universal cycles of combinatorial objects
- Constructing the first (and coolest) fixed-content universal cycle
- On universal cycles for new classes of combinatorial structures
- Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\)
- Graph universal cycles: compression and connections to universal cycles
- Shortened universal cycles for permutations
This page was built for publication: On universal cycles of labeled graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380435)
