1. Diestel R (2005) Graph Theory (Graduate Texts in Mathematics). Heidelberg, Springer, Berlin
2. Garey MR (1979) Computers and intractability: a guide to the theory of np-completeness. Revista Da Escola De Enfermagem Da USP 44(2):340
3. Mateti P, Deo N (1976) On algorithms for enumerating all circuits of a graph. SIAM J Comput 5(1):90–99
4. Tarjan R (1973) Enumeration of the elementary circuits of a directed graph. SIAM J Comput 2(3):211–216
5. Liu H, Wang J (2006) A new way to enumerate cycles in graph. Advanced Int’1 Conference on Telecommunications and Int’1 Conference on Internet and Web Applications and Services (AICT-ICIW’06). Guadeloupe, French Caribbean, pp 57–57