Search Results for ""

A planar embedding, also called a "plane graph" (Harary 1994, p. 103; Harborth and Möller 1994), "planar drawing," or "plane drawing," of a planar graph is an embedding in ...

Several differing definitions of almost planar (as well as nearly planar) have been used in the literature (cf. Lipton et al. 2016). For example, Gubser (1996) defines an ...

A graph is planar if it can be drawn in a plane without graph edges crossing (i.e., it has graph crossing number 0). The number of planar graphs with n=1, 2, ... nodes are 1, ...

A planar connected graph is a graph which is both planar and connected. The numbers of planar connected graphs with n=1, 2, ... nodes are 1, 1, 2, 6, 20, 99, 646, 5974, ...

A point p on a regular surface M in R^3 is said to be planar if the Gaussian curvature K(p)=0 and S(p)=0 (where S is the shape operator), or equivalently, both of the ...

A planar hypohamiltonian graph is a hypohamiltonian graph that is also planar. A number of planar hypohamiltonian graphs are illustrated above. Chvátal (1973) first asked if ...

A planar hypotraceable graph is a hypotraceable graph that is also planar. A number of planar hypotraceable graphs are illustrated above. Using a theorem of Thomassen (1974), ...

A planar straight line embedding of a planar graph is a planar embedding in which only straight line segments are used to connect the graph vertices. Fáry (1948) showed that ...

Flat polygons embedded in three-space can be transformed into a congruent planar polygon as follows. First, translate the starting vertex to (0, 0, 0) by subtracting it from ...

A graph with projective plane crossing number equal to 0 may be said to be projective planar. Examples of projective planar graphs with graph crossing number >=2 include the ...