Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Edge_cycle_cover> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples 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 wikiPageLength "1842".
- Edge_cycle_cover wikiPageOutDegree "14".
- Edge_cycle_cover wikiPageRevisionID "618761645".
- Edge_cycle_cover wikiPageWikiLink Bridge_(graph_theory).
- Edge_cycle_cover wikiPageWikiLink Category:Combinatorial_optimization.
- Edge_cycle_cover wikiPageWikiLink Category:Graph_theory_objects.
- Edge_cycle_cover wikiPageWikiLink Cycle_(graph_theory).
- Edge_cycle_cover wikiPageWikiLink Cycle_double_cover.
- Edge_cycle_cover wikiPageWikiLink Cycle_double_cover_conjecture.
- Edge_cycle_cover wikiPageWikiLink Glossary_of_graph_theory.
- Edge_cycle_cover wikiPageWikiLink Graph_(mathematics).
- Edge_cycle_cover wikiPageWikiLink Mathematics.
- Edge_cycle_cover wikiPageWikiLink Planar_graph.
- Edge_cycle_cover wikiPageWikiLink Polynomial_time.
- Edge_cycle_cover wikiPageWikiLink Spanning_subgraph.
- Edge_cycle_cover wikiPageWikiLink Time_complexity.
- Edge_cycle_cover wikiPageWikiLink Vertex_cycle_cover.
- Edge_cycle_cover wikiPageWikiLink Weighted_graph.
- Edge_cycle_cover wikiPageWikiLinkText "Edge cycle cover".
- Edge_cycle_cover hasPhotoCollection Edge_cycle_cover.
- Edge_cycle_cover wikiPageUsesTemplate Template:Reflist.
- Edge_cycle_cover subject Category:Combinatorial_optimization.
- Edge_cycle_cover subject Category:Graph_theory_objects.
- Edge_cycle_cover hypernym Set.
- Edge_cycle_cover type Algorithm.
- Edge_cycle_cover type Combinatoric.
- Edge_cycle_cover type Field.
- Edge_cycle_cover type Relation.
- 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=618761645.
- Edge_cycle_cover isPrimaryTopicOf Edge_cycle_cover.