Canadian Journal of Mathematics · 1975 · 78 citations · 1 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCircuit TheoryCombinatoricsCombinatorial OptimizationGraph AlgorithmsGraph TheoryAlgorithmic Graph TheoryCircuit Graph TheoryGraph-theoretic Circuit FormulationHamiltonian CircuitsHamiltonian GraphsTraveling Salesman ProblemTraveling Salesperson Problem
This paper will continue certain investigations into the geometric nature of the well-known traveling salesman problem: that of determining the extreme Hamiltonian circuits (H-circuits) of a graph.
1