Search Results for ""

A (finite, circular) conical surface is a ruled surface created by fixing one end of a line segment at a point (known as the vertex or apex of the cone) and sweeping the ...

The self-intersection of a one-sided surface. The word "cross-cap" is sometimes also written without the hyphen as the single word "crosscap." The cross-cap can be thought of ...

Grinberg constructed a number of small cubic polyhedral graph that are counterexamples to Tait's Hamiltonian graph conjecture (i.e., that every 3-connected cubic graph is ...

A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...

An n-polyhedral graph (sometimes called a c-net) is a 3-connected simple planar graph on n nodes. Every convex polyhedron can be represented in the plane or on the surface of ...

Sudoku (literally, "single number"), sometimes also is a pencil-and-paper logic puzzle whose goal is to complete a grid satisfying various constraints. In the "classic" ...

A vertex-transitive graph, also sometimes called a node symmetric graph (Chiang and Chen 1995), is a graph such that every pair of vertices is equivalent under some element ...

Watson (1939) considered the following three triple integrals, I_1 = 1/(pi^3)int_0^piint_0^piint_0^pi(dudvdw)/(1-cosucosvcosw) (1) = (4[K(1/2sqrt(2))]^2)/(pi^2) (2) = ...

Yahtzee is a game played with five 6-sided dice. Players take turns rolling the dice, and trying to get certain types of rolls, each with an assigned point value, as ...

An alkane graph is a tree in which vertices correspond to atoms and edges to carbon-carbon or hydrogen-carbon bonds in a chemical alkane. In chemistry, an alkane is an ...