Hamilton Paths in Graphs of Linear Extensions for Unions of Posets

DOI10.1137/0405016MaRDI QIDQ4012444zbMATH OpenOpenAlexFDO

Authors 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

elementary transformationsGray codeHamilton cyclesHamilton pathslinear extensionsposets

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains
• Gray codes with restricted density
• Generating the Linear Extensions of Certain Posets by Transpositions
• scientific article; zbMATH DE number 4106894
• The Graph of Linear Extensions Revisited

Cited in

(12)

• Gray codes from antimatroids
• On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains
• Finding parity difference by involutions
• Gray code enumeration of families of integer partitions
• On the existence of Hamiltonian paths in the cover graph of M(n)
• Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
• The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations
• scientific article; zbMATH DE number 4106894 (Why is no real title available?)
• The Graph of Linear Extensions Revisited
• Star transposition Gray codes for multiset permutations
• Hamiltonian intervals in the lattice of binary paths
• Bender-Knuth involutions on linear extensions of posets

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

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