1 Answers
In mathematics, an edge cycle cover of a graph is a family 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.
5 views
Answered