Hamiltonicity and combinatorial polyhedra

DOI10.1016/0095-8956(81)90032-0MaRDI QIDQ1147161zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

combinatorial polyhedrahamiltonicitymatching polyhedramatroid basis polyhedranode packing polyhedrapermutation polyhedrastable set polyhedra

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph theory (05C99) Polytopes and polyhedra (52Bxx)

Cites work

• Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n)
• scientific article; zbMATH DE number 3659288 (Why is no real title available?)
• scientific article; zbMATH DE number 3659595 (Why is no real title available?)
• scientific article; zbMATH DE number 3518832 (Why is no real title available?)
• scientific article; zbMATH DE number 3575605 (Why is no real title available?)
• Matroid basis graphs. I
• Matroid basis graphs. II
• On certain polytopes associated with graphs
• On Hamilton's ideals
• On Hamiltonian Circuits
• On the Assignment Polytope
• On the Tree Graph of a Matroid

Cited in

(22)

• The graph of perfect matching polytope and an extreme problem
• Adjacency of the best and second best valued solutions in combinatorial optimization problems
• Interchange graphs and the Hamiltonian cycle polytope
• Partial monotonizations of Hamiltonian cycle polytopes: Dimensions and diameters
• Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope
• Any finite group is the group of some binary, convex polytope
• Adjacency on combinatorial polyhedra
• A combinatorial study of partial order polytopes
• On the combinatorial structure of the approval-voting polytope
• Adjacency on the order polytope with applications to the theory of fuzzy measures
• On the diameter of cut polytopes
• The Polytope of Fuzzy Measures and Its Adjacency Graph
• Eulerian Orientations and Circulations
• A convex polytope and an antimatroid for any given, finite group
• Pancyclic properties of the graph of some 0-1 polyhedra
• Adjacencies on random ordering polytopes and flow polytopes
• On the polytope of 3-tolerant fuzzy measures
• 123-avoiding doubly stochastic matrices
• Traversing combinatorial 0/1-polytopes via optimization
• Listing spanning trees of outerplanar graphs by Pivot-exchanges
• Hamiltonicity in (0-1)-polyhedra
• On the polytope of non-additive measures

This page was built for publication: Hamiltonicity and combinatorial polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1147161)