In mathematics, an edge cycle cover (sometimes called simply cycle cover) of a graph is a set of cycles which are subgraphs of G and contain all edges 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.
Read more about Edge Cycle Cover: Double Cycle Cover, See Also
Famous quotes containing the words edge, cycle and/or cover:
“A lonely man is a lonesome thing, a stone, a bone, a stick, a receptacle for Gilbey’s gin, a stooped figure sitting at the edge of a hotel bed, heaving copious sighs like the autumn wind.”
—John Cheever (1912–1982)
“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)
“If I use the media, even with tricks, to publicise a black youth being shot in the back in Teaneck, New Jersey ... then I should be praised for it, and it’s more of a comment on them than me that it would take tricks to make them cover the loss of life.”
—Al, Rev. Sharpton (b. 1954)