Search Results for ""

To color any map on the sphere or the plane requires at most six-colors. This number can easily be reduced to five, and the four-color theorem demonstrates that the necessary ...

A tree to whose nodes and/or edges labels (usually number) are assigned. The word "weight" also has a more specific meaning when applied to trees, namely the weight of a tree ...

Multiple edges are two or more edges connecting the same two vertices within a multigraph. Multiple edges of degree d_(ij) between vertex i and vertex j correspond to an ...

The bandwidth of a matrix M=(m_(ij)) is the maximum value of |i-j| such that m_(ij) is nonzero.

A tree spread in which each node has a finite number of children.

A theory of Hamiltonian cycles.

A relation R on a set S is transitive provided that for all x, y and z in S such that xRy and yRz, we also have xRz.

The 600-cell is the finite regular four-dimensional polytope with Schläfli symbol {3,3,5}. It is also known as the hypericosahedron or hexacosichoron. It is composed of 600 ...

A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.

A Ramsey number of the form R(k,k;2).