Hamiltonicity in (0-1)-polyhedra
From MaRDI portal
Publication:796554
DOI10.1016/0095-8956(84)90043-1zbMATH Open0544.05058OpenAlexW2042483675MaRDI QIDQ796554FDOQ796554
Authors: Denis Naddef, William R. Pulleyblank 
Publication date: 1984
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(84)90043-1
Cites Work
- Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hamiltonicity and combinatorial polyhedra
- On the graph structure of convex polyhedra in \(n\)-space
- Pancyclic properties of the graph of some 0-1 polyhedra
- Title not available (Why is that?)
Cited In (31)
- Interchange graphs and the Hamiltonian cycle polytope
- Geometry, complexity, and combinatorics of permutation polytopes
- The graph of perfect matching polytope and an extreme problem
- Skeleton matching polytope: realization and isomorphism
- 123-avoiding doubly stochastic matrices
- The skeleton of the symmetric Traveling Salesman Polytope
- Second kind maximum matching graph
- On the diameter of lattice polytopes
- On the hardness of Gray code problems for combinatorial objects
- Distance between two vertices of maximum matching graphs
- On assignment functions
- Traversing combinatorial 0/1-polytopes via optimization
- On the expansion of combinatorial polytopes
- Pancyclic properties of the graph of some 0-1 polyhedra
- Hamiltonicity of a type of interchange graphs
- Characterizations of maximum matching graphs of certain types
- The Hirsch conjecture is true for (0,1)-polytopes
- Polyhedra with few 3-cuts are Hamiltonian
- Improved bounds on the diameter of lattice polytopes
- Z-transformation graphs of perfect matchings of hexagonal systems
- The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)
- On the number of minimal 1-Steiner trees
- A characterization of PM-compact Hamiltonian bipartite graphs
- On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph
- Lattice-free polytopes and their diameter
- A lower bound for the connectivity of directed Euler tour transformation graphs
- Hamiltonicity of amalgams
- Eulerian Orientations and Circulations
- Partial monotonizations of Hamiltonian cycle polytopes: Dimensions and diameters
- On hamiltonian triangulations in simple polygons (Extended Abstract)
- Hamiltonian simple polytopes
This page was built for publication: Hamiltonicity in (0-1)-polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796554)
