On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets
From MaRDI portal
Publication:3885529
DOI10.1287/moor.5.2.285zbMath0442.90070OpenAlexW2081290549MaRDI QIDQ3885529
Publication date: 1980
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.5.2.285
combinatorial optimizationfacetshypohamiltonian graphshypotraceable graphstravelling salesman polytopemonotone symmetric travelling salesman problem
Extremal problems in graph theory (05C35) Integer programming (90C10) Eulerian and Hamiltonian graphs (05C45) Polytopes and polyhedra (52Bxx)
Related Items (6)
The complexity of facets resolved ⋮ On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets ⋮ Hypotraceable digraphs ⋮ Vertex degrees and 2-cuts in graphs with many Hamiltonian vertex-deleted subgraphs ⋮ On Hypohamiltonian and Almost Hypohamiltonian Graphs ⋮ The complexity of facets (and some facets of complexity)
This page was built for publication: On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets
