Algorithm 492: Generation of all the cycles of a graph from a set of basic cycles [H]

A cycle $C$ in a graph is extendable if there exists a cycle ${C^{\prime}}$ such that $V(C) \subseteq V({C^{\prime}})$ and $\mid V({C^{\prime}}) \mid = \mid V(C) \mid + 1$. A graph is cycle extendable if every non-Hamiltonian cycle in the graph is ...

A classic theorem of Erdos and Posa states that there exists a constant c such that for all positive integers k and graphs G, either G contains k vertex disjoint cycles, or there exists a subset of at most cklogk vertices intersecting every cycle of G. ...

The PL/I procedure BASIC_GENERATOR is an implementation of Paton's algorithm [1] for finding a set of basic (fundamental) cycles of a finite undirected graph from its vertex adjacency matrix.