Generating linear extensions of posets by transpositions

DOI10.1016/0095-8956(92)90067-8zbMath0772.06004OpenAlexW2052085947MaRDI QIDQ2368024

Frank Ruskey

Publication date: 18 August 1993

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(92)90067-8

zbMATH Keywords

Hamiltonian cycletranspositiondisjoint chainsforestlinear extensions

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07) Total orders (06A05)

Related Items (17)

On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains ⋮ On the sign-imbalance of skew partition shapes ⋮ Finding parity difference by involutions ⋮ On the probability that a random subtree is spanning ⋮ Signed differential posets and sign-imbalance ⋮ Binary bubble languages and cool-lex order ⋮ Some remarks on sign-balanced and maj-balanced posets ⋮ Signed Mahonians ⋮ Sign-balanced posets ⋮ Bottom-up: a new algorithm to generate random linear extensions of a poset ⋮ Non-crossing trees, quadrangular dissections, ternary trees, and duality-preserving bijections ⋮ Gray code enumeration of families of integer partitions ⋮ Distinct fringe subtrees in random trees ⋮ On arrangements of roots for a real hyperbolic polynomial and its derivatives ⋮ Gray codes from antimatroids ⋮ MINING POSETS FROM LINEAR ORDERS ⋮ Iterative properties of birational rowmotion. I: Generalities and skeletal posets.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transposition generation of alternating permutations
• Gray codes with restricted density
• Minimizing bumps in linear extensions of ordered sets
• Minimizing bumps for posets of width two
• Lexicographic permutations with restrictions
• Solution of some multi-dimensional lattice path parity difference recurrence relations
• A structured program to generate all topological sorting arrangements
• Some Hamilton Paths and a Minimal Change Algorithm
• Generating binary trees by transpositions
• Optimal Linear Extensions by Interchanging Chains
• The Jump Number of Dags and Posets: An Introduction
• An algorithm to generate all topological sorting arrangements
• Generating the Linear Extensions of Certain Posets by Transpositions
• On the generation of all topological sortings
• Adjacent interchange generation of combinations
• Generation of Permutations by Adjacent Transposition
• Permutation by Adjacent Interchanges

This page was built for publication: Generating linear extensions of posets by transpositions