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:
“Oh, life is a glorious cycle of song,
A medley of extemporanea;
And love is a thing that can never go wrong;
And I am Marie of Roumania.”
—Dorothy Parker (1893–1967)
“Every man alone is sincere. At the entrance of a second person, hypocrisy begins. We parry and fend the approach of our fellow-man by compliments, by gossip, by amusements, by affairs. We cover up our thought from him under a hundred folds.”
—Ralph Waldo Emerson (1803–1882)