Pairs of Adjacent Hamiltonian Circuits with Small Intersection

DOI10.1002/SAPM1978593245MaRDI QIDQ4182254zbMATH OpenOpenAlexFDO

Authors Douglas B. West

Publication date 1978

Published in Studies in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/sapm1978593245

zbMATH Keywords

Adjacent Hamiltonian CircuitsTraveling Salesman Problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Integer programming (90C10)

Cites work

• Adjacency of the Traveling Salesman Tours and $0 - 1$ Vertices
• Computer Solutions of the Traveling Salesman Problem
• scientific article; zbMATH DE number 3543850 (Why is no real title available?)
• On the Complexity of Local Search for the Traveling Salesman Problem
• On the Tours of a Traveling Salesman

Cited in

(3)

• Maximizing Hamiltonian pairs and \(k\)-sets via numerous leaves in a tree
• Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles
• Some graphic uses of an even number of odd nodes

This page was built for publication: Pairs of Adjacent Hamiltonian Circuits with Small Intersection

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