scientific article; zbMATH DE number 65462

MaRDI QIDQ4012810zbMATH OpenFDO

Authors Frank Ruskey

Publication date 27 September 1992

zbMATH Keywords

disjoint chainsforestHamiltonian cyclelinear extensionstransposition

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Total orders (06A05) Partial orders, general (06A06)

Recommendations

• Generating linear extensions of posets by transpositions
• Generating the Linear Extensions of Certain Posets by Transpositions
• Generating linear extensions by adjacent transpositions
• Loopless generation of linear extensions of a poset
• On linear extensions of finite posets
• Enumerating S_n by associated transpositions and linear extensions of finite posets
• A loop-free algorithm for generating the linear extensions of a poset
• Linear extensions and order-preserving poset partitions
• Linear extension numbers of \(n\)-element posets
• Linear extensions of finite posets and a conjecture of G. Kreweras on permutations

Cited in

(4)

• Enumerating S_n by associated transpositions and linear extensions of finite posets
• Constructing greedy linear extensions by interchanging chains
• Generating linear extensions by adjacent transpositions
• Generating the Linear Extensions of Certain Posets by Transpositions

This page was built for publication:

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