1. Network Flows;Ahuja,1993
2. B. Alspach, J.-C. Bermond, D. Sotteau, Decomposition into cycles I: Hamilton decompositions, in: G. Hahn et al. (Eds.), Cycles and Rays, Kluwer, Dordrecht, 1990, pp. 9–18.
3. E. Balas, N. Simonetti, Linear time dynamic programming algorithms for some new classes of restricted TSP's, Proceedings of the IPCO V, Lecture Notes in Computer Science, Vol. 1084, 1996, pp. 316–329.
4. Digraphs: Theory, Algorithms and Applications;Bang-Jensen,2000
5. Graph Theory with Applications;Bondy,1976