TOPICS
Search

Search Results for ""


631 - 640 of 2052 for Klein GraphSearch Results
An algebraic surface of degree 12. Examples of dodecic surfaces include the figure-eight parametrization of the Klein bottle and Sarti dodecic.
Consider the plane figure obtained by drawing each diagonal in a regular polygon with n vertices. If each point of intersection is associated with a node and diagonals are ...
The bound for the number of colors which are sufficient for map coloring on a surface of genus g, gamma(g)=|_1/2(7+sqrt(48g+1))_| is the best possible, where |_x_| is the ...
The number of colors sufficient for map coloring on a surface of genus g is given by the Heawood conjecture, chi(g)=|_1/2(7+sqrt(48g+1))_|, where |_x_| is the floor function. ...
An orientation on an n-dimensional manifold is given by a nowhere vanishing differential n-form. Alternatively, it is an bundle orientation for the tangent bundle. If an ...
The toroidal crossing number cr_(1)(G) of a graph G is the minimum number of crossings with which G can be drawn on a torus. A planar graph has toroidal crossing number 0, ...
The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...
A one-sided surface reminiscent of the Möbius strip, attributed to Gourmalin (Bouvier and George 1979, p. 477; Boas 1995). This surface is topologically equivalent to a Klein ...
The 11-cell is a regular 4-dimensional structure that cannot be represented in 3-dimensional space in any reasonable way and is highly self-intersecting even in 4-dimensional ...
The circuit rank gamma, also denoted mu (Volkmann 1996, Babić et al. 2002) or beta (White 2001, p. 56) and known as the cycle rank (e.g., White 2001, p. 56), (first) graph ...
1 ... 61|62|63|64|65|66|67 ... 206 Previous Next

...