We provide relation-algebraic characterisations of elementary, ordinary, and maximal cycles in graphs. Relational specifications for the enumeration of cycles are provided. They are executable within the RelView and RelClipse tools and appear to be useful in various applications. Particularly, cycles offer a valuable instrument for analysing Petri Nets.