Vertex cycle cover
id:
vertex-cycle-cover-166-12921763
title:
Vertex cycle cover
text:
In mathematics, a vertex 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. This is sometimes known as exact vertex cycle cover. In this case the set of the cycles constitutes a spanning subgraph of G. A disjoint cycle cover of an undirected graph can be found in polynomial time by transforming the problem into a pro
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Vertex_cycle_cover
date created:
2008-12-21T21:42:21Z
date modified:
2024-08-30T00:08:53Z
main entity:
{"identifier":"Q17090992","url":"https://www.wikidata.org/entity/Q17090992"}
image:
fields total:
13
integrity:
14