1. Bondy, J.A., Murty, U.S.R. Graph theory with applications. The Macmillan Press Ltd., New York, 1976
2. Cabello, Sergio. Finding shortest contractible and shortest separating cycles in embedded graphs. ACM Transactions on Algorithms, 6(2), Article 24: 1–18 (2010)
3. Cummins, R.L. Hamilton circuits in tree graphs. IEEE Trans Circuit Theory, 13: 82–96 (1966)
4. Glover, F., Klingman, D. Finding minimum spanning trees with a fixed number of links at a node, Combinatorial Programming: Methods and Applications. D. Reidel Publishing Company, Dordrecht, 1975, 191–201
5. Gribb, D.W., Ringeisen, R.D., Shier, D.R. On cycle bases of graph. Congressus Numerantium, 32: 221–229 (1981)