Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Cycle_double_cover> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- Cycle_double_cover abstract "In graph-theoretic mathematics, a cycle double cover is a collection of cycles in an undirected graph that together include each edge of the graph exactly twice. For instance, for any polyhedral graph, the faces of a convex polyhedron that represents the graph provide a double cover of the graph: each edge belongs to exactly two faces.It is an unsolved problem, posed by George Szekeres and Paul Seymour and known as the cycle double cover conjecture, whether every bridgeless graph has a cycle double cover. The conjecture can equivalently be formulated in terms of graph embeddings, and in that context is also known as the circular embedding conjecture.".
- Cycle_double_cover thumbnail Petersen_double_cover.svg?width=300.
- Cycle_double_cover wikiPageExternalLink cycle_double_cover_conjecture.
- Cycle_double_cover wikiPageExternalLink grunbaums_conjecture.
- Cycle_double_cover wikiPageExternalLink the_circular_embedding_conjecture.
- Cycle_double_cover wikiPageExternalLink cyclecov.htm.
- Cycle_double_cover wikiPageID "21486302".
- Cycle_double_cover wikiPageRevisionID "490867245".
- Cycle_double_cover hasPhotoCollection Cycle_double_cover.
- Cycle_double_cover title "Cycle Double Cover Conjecture".
- Cycle_double_cover urlname "CycleDoubleCoverConjecture".
- Cycle_double_cover subject Category:Conjectures.
- Cycle_double_cover subject Category:Graph_theory.
- Cycle_double_cover subject Category:Topological_graph_theory.
- Cycle_double_cover type Abstraction100002137.
- Cycle_double_cover type Cognition100023271.
- Cycle_double_cover type Concept105835747.
- Cycle_double_cover type Conjectures.
- Cycle_double_cover type Content105809192.
- Cycle_double_cover type Hypothesis105888929.
- Cycle_double_cover type Idea105833840.
- Cycle_double_cover type PsychologicalFeature100023100.
- Cycle_double_cover type Speculation105891783.
- Cycle_double_cover comment "In graph-theoretic mathematics, a cycle double cover is a collection of cycles in an undirected graph that together include each edge of the graph exactly twice.".
- Cycle_double_cover label "Cycle double cover".
- Cycle_double_cover sameAs m.05h36zy.
- Cycle_double_cover sameAs Q5198159.
- Cycle_double_cover sameAs Q5198159.
- Cycle_double_cover sameAs Cycle_double_cover.
- Cycle_double_cover wasDerivedFrom Cycle_double_cover?oldid=490867245.
- Cycle_double_cover depiction Petersen_double_cover.svg.
- Cycle_double_cover isPrimaryTopicOf Cycle_double_cover.
