Pages that link to "Item:Q1867280"
From MaRDI portal
The following pages link to A combinatorial study of partial order polytopes (Q1867280):
Displaying 15 items.
- The numbers of edges of the order polytope and the chain polytope of a finite partially ordered set (Q512575) (← links)
- Primary facets of order polytopes (Q730181) (← links)
- Two poset polytopes (Q1077721) (← links)
- Adjacency of vertices of the complete pre-order polytope (Q1377754) (← links)
- On a family of \(0/1\)-polytopes with an NP-complete criterion for vertex nonadjacency relation (Q1741477) (← links)
- On affine reducibility of combinatorial polytopes (Q1761001) (← links)
- Extending shelling orders and a hierarchy of functions of unimodal simple polytopes (Q1894364) (← links)
- Structural aspects of ordered polymatroids (Q1962039) (← links)
- Ising formulations of some graph-theoretic problems in psychological research: models and methods (Q2244634) (← links)
- The common face of some 0/1-polytopes with NP-complete nonadjacency relation (Q2259297) (← links)
- How to recycle your facets (Q2506820) (← links)
- Polyhedral aspects of partial orders and comparability graphs (Q2741302) (← links)
- (Q3769522) (← links)
- Shortest Reconfiguration of Perfect Matchings via Alternating Cycles (Q5074950) (← links)
- Algorithmic aspects of partial convexity (Q5941996) (← links)