Search Results for ""
1871 - 1880 of 13134 for Graph TheorySearch Results
The great dirhombicosidodecahedron is the uniform polyhedron with Maeder index 75 (Maeder 1997), Wenninger index 119 (Wenninger 1989), Coxeter index 82 (Coxeter et al. 1954), ...
The great ditrigonal dodecicosidodecahedron is the uniform polyhedron with Maeder index 42 (Maeder 1997), Wenninger index 81 (Wenninger 1989), Coxeter index 54 (Coxeter et ...
The great icosidodecahedron, not to be confused with the great icosahedron or great icosicosidodecahedron, is the uniform polyhedron with Maeder index 54 (Maeder 1997), ...
The great rhombihexahedron is the uniform polyhedron with Maeder index 21 (Maeder 1997), Wenninger index 103 (Wenninger 1989), Coxeter index 82 (Coxeter et al. 1954), and ...
The great truncated cuboctahedron (Maeder 1997), also called the quasitruncated cuboctahedron (Wenninger 1989, p. 145), is the uniform polyhedron with Maeder index 20 (Maeder ...
The problem of determining how many nonattacking knights K(n) can be placed on an n×n chessboard. For n=8, the solution is 32 (illustrated above). In general, the solutions ...
A short theorem used in proving a larger theorem. Related concepts are the axiom, porism, postulate, principle, and theorem. The late mathematician P. Erdős has often been ...
The Menger sponge is a fractal which is the three-dimensional analog of the Sierpiński carpet. The nth iteration of the Menger sponge is implemented in the Wolfram Language ...
A minimal cover is a cover for which removal of any single member destroys the covering property. For example, of the five covers of {1,2}, namely {{1},{2}}, {{1,2}}, ...
A natural equation is an equation which specifies a curve independent of any choice of coordinates or parameterization. The study of natural equations began with the ...
...
View search results from all Wolfram sites (33872 matches)

