1. Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Berlin (2008)
2. Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th edn. Springer, Berlin (2008)
3. Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, New Jersey (1982)
4. Hassin, R., Tamir, A.: On the minimum diameter spanning tree problem. Inform. Process. Lett. 53, 109–111 (1995)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the NP-Completeness. Freman, New York (1979)