Search Results for ""

How far can a stack of n books protrude over the edge of a table without the stack falling over? It turns out that the maximum overhang possible d_n for n books (in terms of ...

The great dirhombicosidodecahedral graph is the skeleton of the great dirhombicosidodecahedron and the second octahedron 20-compound. It is illustrated above in a few ...

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 connected bipartite graph is called Hamilton-laceable, a term apparently introduced in Simmons (1978), if it has a u-v Hamiltonian path for all pairs of vertices u and v, ...

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. ...

A Hamiltonian path, also called a Hamilton path, is a graph path between two vertices of a graph that visits each vertex exactly once. If a Hamiltonian path exists whose ...

There are a number of algebraic equations known as the icosahedral equation, all of which derive from the projective geometry of the icosahedron. Consider an icosahedron ...

A quartic symmetric graph on 30 nodes and 60 edges corresponding to the skeleton of the Archimdean icosidodecahedron, great dodecahemidodecahedron, great icosidodecahedron, ...

Ball and Coxeter (1987, pp. 277-278) define the ladder graph nP_2, here called the ladder rung graph, of order n as the graph union of n copies of the path graph P_2. The ...

Knuth (2008, p. 44) terms the 24-vertex graph based on the notes of the musical scale illustrated above the "musical graph." This graph can be seen to be the 24-vertex case ...