1. Aho, A.V., Hopcroft, J.E. and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison Wesley, 1974.
2. Beneš, V.E., Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, New York, 1965.
3. Borodin, A.B. and Munro, I. The Complexity of Algebraic and Numeric Problems, American Elsevier, 1975.
4. Ehrenfeucht, A. Practical decidability. Report CU-CS-008-72, Univ. of Colorado (1972).
5. Erdös, P., Graham and Szemerédi, Ě. On sparse graphs with dense long paths. Comp. and Maths. with Appls., 1, (1975) 365–369.