1. J.A. Bondy and U.S.R. Murty,Graph theory with applications (North-Holland, Amsterdam, 1976).
2. G. Cornuéjols, D. Naddef and W.R. Pulleyblank, “Halin graphs and the travelling salesman problem”,Mathematical Programming 26 (1983) 287–294.
3. J. Edmonds, “Matroids and the greedy algorithm”,Mathematical Programming 1 (1971) 127–136.
4. B. Fleischmann, “Linear programming approaches to travelling salesman and vehicle scheduling problems”, Technical Report, Universität Hamburg (paper presented at the XI. International Symposium on Mathematical Programming, Bonn, 1982).
5. B. Fleischmann, “A new class of cutting planes for the symmetric travelling salesman problem”, Report No. QM-03-83, Institut für Unternehmensforschung, Universität Hamburg (1983).