- toroidal embedding
- мат. тороидальное вложение
Большой англо-русский и русско-английский словарь. 2001.
toroidal embedding
Смотреть что такое "toroidal embedding" в других словарях:
Toroidal graph — [ A graph (similar to the Heawood graph) embedded on the torus such that no edges cross. ] In mathematics, a graph G is toroidal if it can be embedded on the torus. In other words, the graph s vertices can be placed on a torus such that no edges… … Wikipedia
David Mumford — in 1975 Born 11 June 1937 (1937 06 11) (age 74) … Wikipedia
Dyck graph — The Dyck graph Named after W. Dyck Vertices 32 Edges … Wikipedia
Toric geometry — In mathematics and theoretical physics, toric geometry is a set of methods in algebraic geometry in which certain complex manifolds are visualized as fiber bundles with multi dimensional tori as fibers.For example, the complex projective plane… … Wikipedia
Torus — Not to be confused with Taurus (disambiguation). This article is about the surface and mathematical concept of a torus. For other uses, see Torus (disambiguation). A torus As the distance to th … Wikipedia
Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 … Wikipedia
Cycle double cover — Unsolved problems in mathematics Does every bridgeless graph have a multiset of cycles covering every edge exactly twice? … Wikipedia
Robertson–Seymour theorem — In graph theory, the Robertson–Seymour theorem (also called the graph minor theorem[1]) states that the undirected graphs, partially ordered by the graph minor relationship, form a well quasi ordering.[2] Equivalently, every family of graphs that … Wikipedia
Topological graph theory — In mathematics topological graph theory is a branch of graph theory. It studies the embedding of graphs in surfaces, and graphs as topological spaces. [J.L. Gross and T.W. Tucker, Topological graph theory, Wiley Interscience, 1987] Embedding a… … Wikipedia
Möbius–Kantor graph — Named after August Ferdinand Möbius and S. Kantor Vertices 16 … Wikipedia
Heawood graph — infobox graph name = Heawood graph image caption = namesake = Percy John Heawood vertices = 14 edges = 21 girth = 6 chromatic number = 2 chromatic index = 3 properties = Cubic Cage Distance regular ToroidalIn the mathematical field of graph… … Wikipedia
