On universal cycles of labeled graphs
From MaRDI portal
Publication:2380435
zbMath1184.05110arXiv0808.3610MaRDI QIDQ2380435
Emma E. Snively, Bill Kay, Greg Brockman
Publication date: 26 March 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0808.3610
Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Eulerian and Hamiltonian graphs (05C45)
Related Items
Universal and overlap cycles for posets, words, and juggling patterns, Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles, Graph universal cycles: compression and connections to universal cycles, The lexicographically smallest universal cycle for binary strings with minimum specified weight, Constructing the first (and coolest) fixed-content universal cycle, Binary bubble languages and cool-lex order, Graph universal cycles of combinatorial objects, Shortened universal cycles for permutations