Search Results for ""

A polyhedron is rigid if it cannot be continuously deformed into another configuration. A rigid polyhedron may have two or more stable forms which cannot be continuously ...

A rolling polyhedron graph is a graph obtained by rolling a polyhedral solid along a board whose tiles match up with the faces of the polyhedron being rolled. The vertices of ...

A secant line, also simply called a secant, is a line passing through two points of a curve. As the two points are brought together (or, more precisely, as one is brought ...

There appears to be no term in standard use for a graph with graph crossing number 1. Furthermore, the terms "almost planar" and "1-planar" are used in the literature for ...

In discrete percolation theory, site percolation is a percolation model on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the lattice vertices ...

"The" tetrahedral graph is the Platonic graph that is the unique polyhedral graph on four nodes which is also the complete graph K_4 and therefore also the wheel graph W_4. ...

A traceable graph is a graph that possesses a Hamiltonian path. Hamiltonian graphs are therefore traceable, but the converse is not necessarily true. Graphs that are not ...

The uniformity conjecture postulates a relationship between the syntactic length of expressions built up from the natural numbers using field operations, exponentials, and ...

A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...

An xyz embedding, also called an "xyz drawing," is a three-dimensional embedding such that every axis-parallel line contains either zero or two vertices. Such an embedding is ...