Hamilton Paths in Graphs of Linear Extensions for Unions of Posets

DOI10.1137/0405016zbMath0757.05076OpenAlexW2050684277MaRDI QIDQ4012444

Grzegorz Stachowiak

Publication date: 27 September 1992

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0405016

zbMATH Keywords

posetsGray codeHamilton cycleslinear extensionsHamilton pathselementary transformations

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains ⋮ The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations ⋮ Finding parity difference by involutions ⋮ Star transposition Gray codes for multiset permutations ⋮ Gray code enumeration of families of integer partitions ⋮ Gray codes from antimatroids

This page was built for publication: Hamilton Paths in Graphs of Linear Extensions for Unions of Posets