Hamiltonicity in (0-1)-polyhedra
From MaRDI portal
Publication:796554
DOI10.1016/0095-8956(84)90043-1zbMath0544.05058OpenAlexW2042483675MaRDI QIDQ796554
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
Related Items
Eulerian Orientations and Circulations, Hamiltonicity of a type of interchange graphs, On the number of minimal 1-Steiner trees, On the diameter of lattice polytopes, Lattice-free polytopes and their diameter, A lower bound for the connectivity of directed Euler tour transformation graphs, On assignment functions, Pancyclic properties of the graph of some 0-1 polyhedra, Interchange graphs and the Hamiltonian cycle polytope, On the expansion of combinatorial polytopes, The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract), On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph, Second kind maximum matching graph, Improved bounds on the diameter of lattice polytopes, Geometry, complexity, and combinatorics of permutation polytopes, Distance between two vertices of maximum matching graphs, Characterizations of maximum matching graphs of certain types, The skeleton of the symmetric Traveling Salesman Polytope, Z-transformation graphs of perfect matchings of hexagonal systems, The Hirsch conjecture is true for (0,1)-polytopes, Skeleton matching polytope: realization and isomorphism, The graph of perfect matching polytope and an extreme problem, Partial monotonizations of Hamiltonian cycle polytopes: Dimensions and diameters, A characterization of PM-compact Hamiltonian bipartite graphs
Cites Work
