Vertex Cycle Cover

In mathematics, a vertex cycle cover (commonly called simply cycle cover) of a graph G is a set of cycles which are subgraphs of G and contain all vertices of G.

If the cycles of the cover have no vertices in common, the cover is called vertex-disjoint or sometimes simply disjoint cycle cover. In this case the set of the cycles constitutes a spanning subgraph of G.

If the cycles of the cover have no edges in common, the cover is called edge-disjoint or simply disjoint cycle cover.

Similar definitions may be introduced for digraphs, in terms of directed cycles.

Read more about Vertex Cycle Cover:  See Also

Famous quotes containing the words cycle and/or cover:

    Only mediocrities progress. An artist revolves in a cycle of masterpieces, the first of which is no less perfect than the last.
    Oscar Wilde (1854–1900)

    When you are listening to music it is better to cover your eyes than your ears.
    José Bergamín (1895–1983)