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-4MaRDI QIDQ1331990zbMATH OpenOpenAlexFDO

Authors 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

graphHamilton cycleposetchainslinear extensionsHamilton pathlong cycle

Mathematics Subject Classification ID

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

Recommendations

• Generating the Linear Extensions of Certain Posets by Transpositions
• Hamilton Paths in Graphs of Linear Extensions for Unions of Posets
• scientific article; zbMATH DE number 4106894
• The Graph of Linear Extensions Revisited

Cites work

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

Cited in

(7)

• Generating the Linear Extensions of Certain Posets by Transpositions
• Linear extension majority cycles in height-1 orders
• The Graph of Linear Extensions Revisited
• Hamilton Paths in Graphs of Linear Extensions for Unions of Posets
• scientific article; zbMATH DE number 4106894 (Why is no real title available?)
• On the existence of Hamiltonian paths in the cover graph of \(M\)(\(n\))
• First-Fit is linear on posets excluding two long incomparable chains

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

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