Algorithms for finding a fundamental set of cycles for an undirected linear graph.

C. C. Gotlieb Derek G. Corneil Algorithms for finding a fundamental set of cycles for an undirected linear graph. 780-783 1967 10 Commun. ACM 12 http://doi.acm.org/10.1145/363848.363861 db/journals/cacm/cacm10.html#GotliebC67