Abstract
A graph G is called hypohamiltonian (hypotraceable) if it does not contain a hamiltonian cycle (chain) but if every vertex-deleted subgraph G − v contains a hamiltonian cycle (chain). It is shown that certain classes of these graphs induce facets of the monotone symmetric travelling salesman polytope, i.e. the convex hull of the incidence vectors of all tours and subsets of tours. These results indicate that it is quite unlikely that an explicit complete characterization of this polytope can be obtained.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
