Star transposition Gray codes for multiset permutations

DOI10.1002/jgt.22915zbMath1522.05006arXiv2108.07465OpenAlexW3194551264MaRDI QIDQ6074576

Torsten Mütze, Petr Gregor, Arturo I. Merino

Publication date: 12 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.07465

zbMATH Keywords

permutationtranspositioncombinationHamilton cycleGray code

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedy flipping of pancakes and burnt pancakes
• A new algorithm for generation of permutations
• The coolest way to generate combinations
• An algorithm for generating subsets of fixed size with a strong minimal change property
• Gray codes with restricted density
• Explicit matchings in the middle levels of the Boolean lattice
• A method and two algorithms on the theory of partitions
• A Hamilton cycle in the \(k\)-sided pancake network
• A constant-time algorithm for middle levels Gray codes
• Proof of the middle levels conjecture
• The Greedy Gray Code Algorithm
• Some Hamilton Paths and a Minimal Change Algorithm
• Hyper hamiltonian laceability of Cayley graphs generated by transpositions
• Hamilton Paths in Graphs of Linear Extensions for Unions of Posets
• Doubly adjacent gray codes for the symmetric group
• A Survey of Combinatorial Gray Codes
• A short proof of the middle levels theorem
• Hamiltonian-laceability of star graphs
• Solving the Sigma-Tau Problem
• Adjacent interchange generation of combinations
• Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
• Distance-2 Cyclic Chaining of Constant-Weight Codes
• Generation of Permutations by Adjacent Transposition
• Magical Mathematics
• Hamilton-connected Cayley graphs on Hamiltonian groups