Search Results for ""

There exists no known P algorithm for graph isomorphism testing, although the problem has also not been shown to be NP-complete. In fact, the problem of identifying ...

The square of a graph is defined as its second graph power. The square of any biconnected graph is Hamiltonian (Fleischner 1974, Skiena 1990, p. 231). Mukhopadhyay (1967) has ...

Suppose that G is a pseudograph, E is the edge set of G, and C is the family of edge sets of graph cycles of G. Then C obeys the axioms for the circuits of a matroid, and ...

The great inverted snub icosidodecahedron is the uniform polyhedron with Maeder index 69 (Maeder 1997), Wenninger index 113 (Wenninger 1989), Coxeter index 73 (Coxeter et al. ...

The great retrosnub icosidodecahedron, also called the great inverted retrosnub icosidodecahedron is the uniform polyhedron with Maeder index 74 (Maeder 1997), Wenninger ...

The great rhombidodecahedron is the uniform polyhedron with Maeder index 73 (Maeder 1997), Wenninger index 109 (Wenninger 1989), Coxeter index 89 (Coxeter et al. 1954), and ...

The grid shading problem is the problem of proving the unimodality of the sequence {a_1,a_2,...,a_(mn)}, where for fixed m and n, a_i is the number of partitions of i with at ...

"The" Griffiths point Gr is the fixed point in Griffiths' theorem. Given four points on a circle and a line through the center of the circle, the four corresponding Griffiths ...

Given two groups G and H, there are several ways to form a new group. The simplest is the direct product, denoted G×H. As a set, the group direct product is the Cartesian ...

A set of generators (g_1,...,g_n) is a set of group elements such that possibly repeated application of the generators on themselves and each other is capable of producing ...