1. Ariosto L., Orlando Furioso, XXIV, 2 (1532).
2. Karp, R.M., Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations, Pergamon Press, Oxford & N.Y. (1972) 85–103.
3. Aho, A.V., Hoperoft, J.E. and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison Wesley, Reading, Mass. (1974).
4. Garey, M.R. and Johnson, D.S., Computers and Intractability, W.H. Freeman & Co., S. Francisco (1979).
5. Camerini, P.M., Galbiati,G., and Maffioli, F., Complexity of Spanning tree problems: Part I, EJOR (to appear).