Pages that link to "Item:Q1842660"
From MaRDI portal
The following pages link to Adjacency on combinatorial polyhedra (Q1842660):
Displaying 13 items.
- On the diameter of cut polytopes (Q271649) (← links)
- On the diameter of partition polytopes and vertex-disjoint cycle cover (Q378108) (← links)
- Vertex adjacencies in the set covering polyhedron (Q730484) (← links)
- The monotonic diameter of traveling salesman polytopes (Q1271383) (← links)
- Weak order polytopes. (Q1420590) (← links)
- Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope (Q1662101) (← links)
- Any finite group is the group of some binary, convex polytope (Q1704900) (← links)
- The hierarchy of circuit diameters and transportation polytopes (Q1707908) (← links)
- On the combinatorial structure of the approval-voting polytope (Q1867363) (← links)
- Ideal polytopes and face structures of some combinatorial optimization problems (Q1924055) (← links)
- The common face of some 0/1-polytopes with NP-complete nonadjacency relation (Q2259297) (← links)
- Expansion of random 0/1 polytopes (Q6119221) (← links)
- Adjacencies on random ordering polytopes and flow polytopes (Q6134082) (← links)
