- triangular embedding
- мат. треугольное вложение (в граф)
Большой англо-русский и русско-английский словарь. 2001.
triangular embedding
Смотреть что такое "triangular embedding" в других словарях:
Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 … Wikipedia
List of mathematics articles (E) — NOTOC E E₇ E (mathematical constant) E function E₈ lattice E₈ manifold E∞ operad E7½ E8 investigation tool Earley parser Early stopping Earnshaw s theorem Earth mover s distance East Journal on Approximations Eastern Arabic numerals Easton s… … Wikipedia
Tetrahedron — For the academic journal, see Tetrahedron (journal). Regular Tetrahedron (Click here for rotating model) Type Platonic solid Elements F = 4, E = 6 V = 4 (χ = 2) Faces by s … Wikipedia
List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… … Wikipedia
Convex uniform honeycomb — The alternated cubic honeycomb is one of 28 space filling uniform tessellations in Euclidean 3 space, composed of alternating yellow tetrahedra and red octahedra. In geometry, a convex uniform honeycomb is a uniform tessellation which fills three … Wikipedia
Fáry's theorem — states that any simple planar graph can be drawn without crossings so that its edges are straight line segments. That is, the ability to draw graph edges as curves instead of as straight line segments does not allow a larger class of graphs to be … Wikipedia
Dice — For other uses, see Dice (disambiguation). Four coloured dice showing all six possible sides (on a right handed, 6 sided die with pips) A die (plural dice, from Old French dé, from Latin datum something which is given or played )[1] … Wikipedia
Circle packing theorem — Example of the circle packing theorem on K5, the complete graph on five vertices, minus one edge. The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane … Wikipedia
Normal matrix — A complex square matrix A is a normal matrix if where A* is the conjugate transpose of A. That is, a matrix is normal if it commutes with its conjugate transpose. If A is a real matrix, then A*=AT. Hence, the matrix is normal if ATA = AAT.… … Wikipedia
List of mathematics articles (G) — NOTOC G G₂ G delta space G networks Gδ set G structure G test G127 G2 manifold G2 structure Gabor atom Gabor filter Gabor transform Gabor Wigner transform Gabow s algorithm Gabriel graph Gabriel s Horn Gain graph Gain group Galerkin method… … Wikipedia
IPv6 — Internet protocol suite Application layer BGP DHCP DNS FTP … Wikipedia
