Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q17090992> ?p ?o }
Showing triples 1 to 21 of
21
with 100 triples per page.
- Q17090992 subject Q7132783.
- Q17090992 subject Q7481159.
- Q17090992 abstract "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. A disjoint cycle cover of an undirected graph (if it exists) can be found in polynomial time by transforming the problem into a problem of finding a perfect matching in a larger graph.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.".
- Q17090992 wikiPageWikiLink Q1065144.
- Q17090992 wikiPageWikiLink Q1137726.
- Q17090992 wikiPageWikiLink Q1344007.
- Q17090992 wikiPageWikiLink Q141488.
- Q17090992 wikiPageWikiLink Q166507.
- Q17090992 wikiPageWikiLink Q1994977.
- Q17090992 wikiPageWikiLink Q215206.
- Q17090992 wikiPageWikiLink Q2393193.
- Q17090992 wikiPageWikiLink Q245595.
- Q17090992 wikiPageWikiLink Q4653447.
- Q17090992 wikiPageWikiLink Q5337694.
- Q17090992 wikiPageWikiLink Q7132783.
- Q17090992 wikiPageWikiLink Q727035.
- Q17090992 wikiPageWikiLink Q7481159.
- Q17090992 wikiPageWikiLink Q841545.
- Q17090992 wikiPageWikiLink Q908207.
- Q17090992 comment "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.".
- Q17090992 label "Vertex cycle cover".