Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7370316> ?p ?o }
Showing triples 1 to 30 of
30
with 100 triples per page.
- Q7370316 subject Q9141738.
- Q7370316 abstract "In combinatorial mathematics, rotation systems encode embeddings of graphs onto orientable surfaces, by describing the circular ordering of a graph's edges around each vertex.A more formal definition of a rotation system involves pairs of permutations; such a pair is sufficient to determine a multigraph, a surface, and a 2-cell embedding of the multigraph onto the surface.Every rotation scheme defines a unique 2-cell embedding of a connected multigraph on a closed oriented surface (up to orientation preserving topological equivalence). Conversely, any embedding of a connected multigraph G on an oriented closed surface defines a unique rotation system having G as its underlying multigraph. This fundamental equivalence between rotation systems and 2-cell-embeddings was first settled in a dual form by Heffter and extensively used by Ringel during the 1950s. Independently, Edmonds gave the primal form of the theorem and the details of his study have been popularized by Youngs. The generalization to the whole set of multigraphs was developed by Gross and Alpert.Rotation systems are related to, but not the same as, the rotation maps used by Reingold et al. (2002) to define the zig-zag product of graphs. A rotation system specifies a circular ordering of the edges around each vertex, while a rotation map specifies a (non-circular) permutation of the edges at each vertex. In addition, rotation systems can be defined for any graph, while as Reingold et al. define them rotation maps are restricted to regular graphs.".
- Q7370316 wikiPageWikiLink Q1045720.
- Q7370316 wikiPageWikiLink Q113731.
- Q7370316 wikiPageWikiLink Q131476.
- Q7370316 wikiPageWikiLink Q176916.
- Q7370316 wikiPageWikiLink Q184871.
- Q7370316 wikiPageWikiLink Q24158.
- Q7370316 wikiPageWikiLink Q2748415.
- Q7370316 wikiPageWikiLink Q288465.
- Q7370316 wikiPageWikiLink Q395.
- Q7370316 wikiPageWikiLink Q484298.
- Q7370316 wikiPageWikiLink Q4938578.
- Q7370316 wikiPageWikiLink Q5198223.
- Q7370316 wikiPageWikiLink Q5597085.
- Q7370316 wikiPageWikiLink Q564426.
- Q7370316 wikiPageWikiLink Q573901.
- Q7370316 wikiPageWikiLink Q6023610.
- Q7370316 wikiPageWikiLink Q703577.
- Q7370316 wikiPageWikiLink Q734209.
- Q7370316 wikiPageWikiLink Q7370308.
- Q7370316 wikiPageWikiLink Q76592.
- Q7370316 wikiPageWikiLink Q8071744.
- Q7370316 wikiPageWikiLink Q826467.
- Q7370316 wikiPageWikiLink Q83478.
- Q7370316 wikiPageWikiLink Q846862.
- Q7370316 wikiPageWikiLink Q9141738.
- Q7370316 wikiPageWikiLink Q92866.
- Q7370316 comment "In combinatorial mathematics, rotation systems encode embeddings of graphs onto orientable surfaces, by describing the circular ordering of a graph's edges around each vertex.A more formal definition of a rotation system involves pairs of permutations; such a pair is sufficient to determine a multigraph, a surface, and a 2-cell embedding of the multigraph onto the surface.Every rotation scheme defines a unique 2-cell embedding of a connected multigraph on a closed oriented surface (up to orientation preserving topological equivalence). ".
- Q7370316 label "Rotation system".