The following pages link to Hamiltonicity in (0-1)-polyhedra (Q796554):
Displaying 27 items.
- On the diameter of lattice polytopes (Q282757) (← links)
- Pancyclic properties of the graph of some 0-1 polyhedra (Q595680) (← links)
- Geometry, complexity, and combinatorics of permutation polytopes (Q690026) (← links)
- Distance between two vertices of maximum matching graphs (Q705048) (← links)
- On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph (Q911485) (← links)
- The graph of perfect matching polytope and an extreme problem (Q1044975) (← links)
- Hamiltonicity of a type of interchange graphs (Q1329809) (← links)
- On the number of minimal 1-Steiner trees (Q1330879) (← links)
- Lattice-free polytopes and their diameter (Q1346126) (← links)
- A lower bound for the connectivity of directed Euler tour transformation graphs (Q1356528) (← links)
- Interchange graphs and the Hamiltonian cycle polytope (Q1382266) (← links)
- Partial monotonizations of Hamiltonian cycle polytopes: Dimensions and diameters (Q1582079) (← links)
- Improved bounds on the diameter of lattice polytopes (Q1747971) (← links)
- Characterizations of maximum matching graphs of certain types (Q1772424) (← links)
- The skeleton of the symmetric Traveling Salesman Polytope (Q1801669) (← links)
- Z-transformation graphs of perfect matchings of hexagonal systems (Q1825211) (← links)
- The Hirsch conjecture is true for (0,1)-polytopes (Q1825756) (← links)
- Skeleton matching polytope: realization and isomorphism (Q2328087) (← links)
- A characterization of PM-compact Hamiltonian bipartite graphs (Q2355348) (← links)
- Second kind maximum matching graph (Q2439122) (← links)
- The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract) (Q2971660) (← links)
- Eulerian Orientations and Circulations (Q3697049) (← links)
- On assignment functions (Q3729085) (← links)
- On the expansion of combinatorial polytopes (Q5096818) (← links)
- 123-avoiding doubly stochastic matrices (Q6565834) (← links)
- On the hardness of Gray code problems for combinatorial objects (Q6575387) (← links)
- Traversing combinatorial 0/1-polytopes via optimization (Q6602241) (← links)
