1. V. A. Arlazarov, A. V. Uskov, and I. A. Faradzhev, “An algorithm for finding all simple cycles in an oriented graph,” in: Investigations in Discrete Mathematics [in Russian], Nauka, Moscow (1973), pp. 178–183.
2. A. Ajo, J. Hopkroft, and J. Ulman, Construction and Analysis of Computing Algorithms [Russian translation], Mir, Moscow (1979).
3. N. N. Vorob'ev, Jr., “On the complexity of recognizing stability in graphs,” Multistep Differential, Coalition-Free and Cooperative Games and Their Applications [in Russian], Kalinin (1982), pp. 110–114.
4. E. N. Gordeev, “New estimates in the covering problem,” Modeling and Optimization of Complex Control Systems [in Russian], Moscow (1981), pp. 116–122.
5. M. Gary and D. Johnson, Computing Machines and Hard-to-Solve Problems [Russian translation], Mir, Moscow (1982).