Search Results for ""

Let G be a graph with A and B two disjoint n-tuples of graph vertices. Then either G contains n pairwise disjoint AB-paths, each connecting a point of A and a point of B, or ...

A problem which is both NP (verifiable in nondeterministic polynomial time) and NP-hard (any NP-problem can be translated into this problem). Examples of NP-hard problems ...

The octahemioctahedron, also called the octatetrahedron, is the uniform polyhedron with Maeder index 3 (Maeder 1997), Wenninger index 68 (Wenninger 1989), Coxeter index 37 ...

A partially ordered set (or poset) is a set taken together with a partial order on it. Formally, a partially ordered set is defined as an ordered pair P=(X,<=), where X is ...

The pentagrammic antiprism is the uniform polyhedron with Maeder index 79 (Maeder 1997), Coxeter index 34 (Coxeter et al. 1954), and Har'El index 4 (Har'El 1993). It will be ...

The pentagrammic crossed antiprism is the uniform polyhedron with Maeder index 80 (Maeder 1997), Coxeter index 35 (Coxeter et al. 1954), and Har'El index 5 (Har'El 1993). It ...

The pentagrammic prism is the self-intersecting uniform polyhedron with Maeder index 78 (Maeder 1997), Coxeter index 33 (Coxeter et al. 1954), and Har'El index 3 (Har'El ...

The rhombicosahedron is the uniform polyhedron with Maeder index 56 (Maeder 1997), Wenninger index 96 (Wenninger 1989), Coxeter index 72 (Coxeter et al. 1954), and Har'El ...

par The rhombidodecadodecahedron is the uniform polyhedron with Maeder index 38 (Maeder 1997), Wenninger index 76 (Wenninger 1989), Coxeter index 48 (Coxeter et al. 1954), ...

Consider the circles centered on the midpoints of the sides of a reference triangle and passing though the orthocenter H. These circles cut the sides in six points lying on a ...