Boffey, T. B. A note on minimal length Hamilton path and circuit algorithms. (English) Zbl 0269.90050 Oper. Res. Quart. 24, 437-439 (1973). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page MSC: 90C35 Programming involving graphs or networks 05C35 Extremal problems in graph theory PDF BibTeX XML Cite \textit{T. B. Boffey}, Oper. Res. Quart. 24, 437--439 (1973; Zbl 0269.90050) Full Text: DOI