Enumeration of all circuits of a graph
V.V. Bapeswara Rao, Vempati G. K. Murti · Proceedings of the IEEE · 1969
An algorithm is presented to enumerate all circuits of a linear graph. The method is suitable for computerization and does not require a large computer memory. The application of the procedure to some other enumeration problems is discussed.