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-4zbMATH Open0805.05052OpenAlexW1985826386MaRDI QIDQ1331990FDOQ1331990

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

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

zbMATH Keywords

graphHamilton cycleposetchainslinear extensionsHamilton pathlong cycle

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Generating the Linear Extensions of Certain Posets by Transpositions
• Hamilton Paths in Graphs of Linear Extensions for Unions of Posets
• First-Fit is linear on posets excluding two long incomparable chains
• The Graph of Linear Extensions Revisited
• Title not available (Why is that?)
• Linear extension majority cycles in height-1 orders
• On the existence of Hamiltonian paths in the cover graph of \(M\)(\(n\))

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)