Hamiltonicity and combinatorial polyhedra
From MaRDI portal
Publication:1147161
DOI10.1016/0095-8956(81)90032-0zbMath0449.05042OpenAlexW2033055638MaRDI QIDQ1147161
Denis Naddef, William R. Pulleyblank
Publication date: 1981
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(81)90032-0
hamiltonicitycombinatorial polyhedramatching polyhedramatroid basis polyhedranode packing polyhedrapermutation polyhedrastable set polyhedra
Related Items
Eulerian Orientations and Circulations, On the diameter of cut polytopes, On the polytope of non-additive measures, Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope, Pancyclic properties of the graph of some 0-1 polyhedra, Interchange graphs and the Hamiltonian cycle polytope, Adjacencies on random ordering polytopes and flow polytopes, Any finite group is the group of some binary, convex polytope, The Polytope of Fuzzy Measures and Its Adjacency Graph, A convex polytope and an antimatroid for any given, finite group, Adjacency on the order polytope with applications to the theory of fuzzy measures, The graph of perfect matching polytope and an extreme problem, Partial monotonizations of Hamiltonian cycle polytopes: Dimensions and diameters, Adjacency on combinatorial polyhedra, Hamiltonicity in (0-1)-polyhedra, Adjacency of the best and second best valued solutions in combinatorial optimization problems, A combinatorial study of partial order polytopes, On the combinatorial structure of the approval-voting polytope
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n)
- On certain polytopes associated with graphs
- On Hamilton's ideals
- Matroid basis graphs. I
- Matroid basis graphs. II
- On the Assignment Polytope
- On the Tree Graph of a Matroid
- On Hamiltonian Circuits
