The Graph of Linear Extensions Revisited
From MaRDI portal
Recommendations
- On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains
- A recurrence for linear extensions
- Hamilton Paths in Graphs of Linear Extensions for Unions of Posets
- Generating the Linear Extensions of Certain Posets by Transpositions
- A relation between the comparability graph and the number of linear extensions
Cited in
(17)- COMs: complexes of oriented matroids
- Linear extension diameter of level induced subposets of the Boolean lattice
- Linear extension diameter of subposets of Boolean lattice induced by two levels
- A relation between the comparability graph and the number of linear extensions
- Systematic generation of linear graphs - check and extension of the list of Uhlenbeck and Ford
- Birational rowmotion on a rectangle over a noncommutative ring
- A polynomial time algorithm for the 2-poset cover problem
- On the diameters of friends-and-strangers graphs
- Hamilton Paths in Graphs of Linear Extensions for Unions of Posets
- Regular subgraphs of linear extension graphs.
- Graph orientations and linear extensions
- Linear extensions and order-preserving poset partitions
- scientific article; zbMATH DE number 5811090 (Why is no real title available?)
- The number of linear extensions of bipartite graphs
- Constructing greedy linear extensions by interchanging chains
- Bender-Knuth involutions on linear extensions of posets
- The system of abstract connected subgraphs of a linear graph
This page was built for publication: The Graph of Linear Extensions Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4490791)
