Search Results for ""

A dragon curve is a recursive nonintersecting curve whose name derives from its resemblance to a certain mythical creature. The curve can be constructed by representing a ...

A finite field is a field with a finite field order (i.e., number of elements), also called a Galois field. The order of a finite field is always a prime or a power of a ...

The Grötzsch graph is smallest triangle-free graph with chromatic number four. It is identical to the Mycielski graph of order four, and is implemented as ...

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...

The hemicubical graph is the skeleton of the hemicube. It has 7 vertices, 11 edges, and 6 faces. It is implemented in the Wolfram Language as GraphData["HemicubicalGraph"].

The hemiobelisk graph is the skeleton of the hemiobelisk. It has 7 vertices, 11 edges, and 6 faces. It is a minimal unit-distance forbidden graph. It is implemented in the ...

In a 1847 talk to the Académie des Sciences in Paris, Gabriel Lamé (1795-1870) claimed to have proven Fermat's last theorem. However, Joseph Liouville immediately pointed out ...

A Möbius ladder, sometimes called a Möbius wheel (Jakobson and Rivin 1999), of order n is a simple graph obtained by introducing a twist in a prism graph of order n that is ...

The word net has several meanings in mathematics. It refers to a plane diagram in which the polyhedron edges of a polyhedron are shown, a point set satisfying certain ...

A point lattice is a regularly spaced array of points. In the plane, point lattices can be constructed having unit cells in the shape of a square, rectangle, hexagon, etc. ...