Universal cycles for permutation classes

MaRDI QIDQ3176554zbMATH OpenFDO

Authors Julian West, Michael Albert

Publication date 23 July 2018

Full work available at URL http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAK0104

zbMATH Keywords

DeBruijn graphsEulerian circuitsrestricted permutationsuniversal cycles

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Eulerian and Hamiltonian graphs (05C45) Applications of graph theory (05C90) Combinatorics on words (68R15)

Recommendations

• Universal cycles for permutations
• Universal cycles of k-subsets and k-permutations
• Enumerations of universal cycles for \(k\)-permutations
• Universal cycles of classes of restricted words
• Universal cycles for combinatorial structures

Cited in

(14)

• Universal cycles for permutations
• On universal cycles for multisets
• A new universal cycle for permutations
• On shortening u-cycles and u-words for permutations
• Shortened universal cycles for permutations
• Universal limits of substitution-closed permutation classes
• Universal cycles for weak orders
• scientific article; zbMATH DE number 3855267 (Why is no real title available?)
• Universal Cycles of Discrete Functions
• Containing all permutations
• 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
• On a family of universal cycles for multi-dimensional permutations

This page was built for publication: Universal cycles for permutation classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176554)