Search Results for ""

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. The most common type of vertex ...

Discrete Mathematics

Several different types of checkerboards are used in different variants of the game of checkers. The usual checkerboard is the one used in so-called "pool checkers," also ...

The first type of tensor-like object derived from a Riemannian metric g which is used to study the geometry of the metric. Christoffel symbols of the first kind are variously ...

A search algorithm of a tree that explores the first child of a node before visiting its siblings. Tarjan (1972) and Hopcroft and Tarjan (1973) showed that depth-first search ...

The ditrigonal dodecadodecahedron, also called the ditrigonal dodecahedron, is the uniform polyhedron with Maeder index 41 (Maeder 1997), Wenninger index 80 (Wenninger 1989), ...

The Earth-Moon problem is a special case of the empire problem for countries with m=2 disjoint regions, with one region of each country lying on the Earth and one on the Moon ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

A quadrilateral in which a pair of opposite sides have the same length and are inclined at 60 degrees to each other (or equivalently, satisfy <A>+<B>=120 degrees). Some ...

By choosing appropriate rules, it is possible to achieve many forms of synchronization within cellular automata. One version, known as the firing squad synchronization ...