Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Edge_cycle_cover> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- Edge_cycle_cover abstract "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.".
- Edge_cycle_cover wikiPageID "20797876".
- Edge_cycle_cover wikiPageRevisionID "508890712".
- Edge_cycle_cover hasPhotoCollection Edge_cycle_cover.
- Edge_cycle_cover subject Category:Combinatorial_optimization.
- Edge_cycle_cover subject Category:Graph_theory.
- Edge_cycle_cover comment "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.".
- Edge_cycle_cover label "Edge cycle cover".
- Edge_cycle_cover sameAs m.057qpck.
- Edge_cycle_cover sameAs Q5337694.
- Edge_cycle_cover sameAs Q5337694.
- Edge_cycle_cover wasDerivedFrom Edge_cycle_cover?oldid=508890712.
- Edge_cycle_cover isPrimaryTopicOf Edge_cycle_cover.