1. A. V. Kostochka and A. I. Serdyukov, “Polynomial Algorithms with Bounds 3/4 and 5/6 for the Maximum Traveling Salesman Problem,” Upravlyaemye Sistemy 26, 55–59 (1985).
2. A. I. Serdyukov, “Asymptotically Exact Algorithm for the Maximum Traveling Salesman Problem in Euclidean Space,” Upravlyaemye Sistemy 27, 79–87 (1987).
3. F. Haray, Graph Theory (Addison-Wesley, Reading, Mass., 1969; Mir, Moscow, 1973).
4. J. Edmonds and E. L. Johnson, “Matchings: a Well Solvable Class of Integer Linear Programs,” in Combinatorial Structures and Their Applications (Gordon and Breach, New York, 1970), pp. 89–92.
5. H. N. Gabow, “An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems,” in Proceedings of the 15th Annual ACM Symposium on Theory of Computing, Boston, 1983 (ACM, New York, 1983), pp. 448–456.