Edge cycle cover
id:
edge-cycle-cover-166-13605003
title:
Edge cycle cover
text:
In graph theory, a branch of 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.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Edge_cycle_cover
date created:
2008-12-21T22:01:26Z
date modified:
2024-08-30T00:13:02Z
main entity:
{"identifier":"Q5337694","url":"https://www.wikidata.org/entity/Q5337694"}
image:
fields total:
13
integrity:
14