Search Results for ""

The 14-faced Archimedean solid with faces 8{3}+6{8}. It is also the uniform polyhedron with Maeder index 9 (Maeder 1997), Wenninger index 8 (Wenninger 1989), Coxeter index 21 ...

The truncated dodecahedron is the 32-faced Archimedean solid with faces 20{3}+12{10}. It is also uniform polyhedron with Maeder index 26 (Maeder 1997), Wenninger index 10 ...

The truncated tetrahedron is the Archimedean solid with faces 4{3}+4{6}. It is also the uniform polyhedron with Maeder index 2 (Maeder 1997), Wenninger index 6 (Wenninger ...

Discrete Mathematics

In graph theory, a cycle graph C_n, sometimes simply known as an n-cycle (Pemmaraju and Skiena 2003, p. 248), is a graph on n nodes containing a single cycle through all ...

Any two rectilinear figures with equal area can be dissected into a finite number of pieces to form each other. This is the Wallace-Bolyai-Gerwien theorem. For minimal ...

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...

A simple graph, also called a strict graph (Tutte 1998, p. 2), is an unweighted, undirected graph containing no graph loops or multiple edges (Gibbons 1985, p. 2; West 2000, ...

Every planar graph (i.e., graph with graph genus 0) has an embedding on a torus. In contrast, toroidal graphs are embeddable on the torus, but not in the plane, i.e., they ...