On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains

DOI10.1016/0012-365X(94)90401-4zbMath0805.05052OpenAlexW1985826386MaRDI QIDQ1331990

Grzegorz Stachowiak

Publication date: 26 January 1995

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90401-4

zbMATH Keywords

graphposetchainsHamilton pathHamilton cyclelong cyclelinear extensions

Mathematics Subject Classification ID

Paths and cycles (05C38) Ordered sets (06A99) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Gray codes with restricted density
• Solution of some multi-dimensional lattice path parity difference recurrence relations
• Generating linear extensions of posets by transpositions
• Some Hamilton Paths and a Minimal Change Algorithm
• Hamilton Paths in Graphs of Linear Extensions for Unions of Posets
• Adjacent interchange generation of combinations

This page was built for publication: On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains