scientific article
From MaRDI portal
Publication:3176554
zbMATH Open1391.05002MaRDI QIDQ3176554FDOQ3176554
Publication date: 23 July 2018
Full work available at URL: http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAK0104
Title of this publication is not available (Why is that?)
Permutations, words, matrices (05A05) Applications of graph theory (05C90) Eulerian and Hamiltonian graphs (05C45) Combinatorics on words (68R15)
Cited In (10)
- Containing All Permutations
- Universal limits of substitution-closed permutation classes
- On a Greedy Algorithm to Construct Universal Cycles for Permutations
- Graph universal cycles: compression and connections to universal cycles
- An explicit universal cycle for the ( n -1)-permutations of an n -set
- Universal Cycles of Discrete Functions
- Universal cycles for weak orders
- On universal cycles for multisets
- Title not available (Why is that?)
- Shortened universal cycles for permutations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176554)
