The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations

DOI10.1007/S10623-016-0301-9MaRDI QIDQ2364644zbMATH OpenOpenAlexWikidataFDO

Authors Tom Verhoeff

Publication date 21 July 2017

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10623-016-0301-9

zbMATH Keywords

Hamiltonian pathminimal-change generationpermutation

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• scientific article; zbMATH DE number 1308950
• scientific article; zbMATH DE number 6850346
• scientific article; zbMATH DE number 3906532
• scientific article; zbMATH DE number 3983215
• The splicing of cycle permutation graphs

Cites work

• Generation of Permutations by Adjacent Transposition
• Hamilton Paths in Graphs of Linear Extensions for Unions of Posets
• scientific article; zbMATH DE number 4106841 (Why is no real title available?)
• Permutation by Adjacent Interchanges
• Solution of some multi-dimensional lattice path parity difference recurrence relations
• Some Hamilton Paths and a Minimal Change Algorithm
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• The permutahedron _n is Hamiltonian

Cited in

(1)

• Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality

Describes a project that uses

Uses Software

• PermutationGraphs

This page was built for publication: The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations

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