Search Results for ""

Let a knot K be n-embeddable. Then its tunnel number is a knot invariant which is related to n.

A k-partite graph is a graph whose graph vertices can be partitioned into k disjoint sets so that no two vertices within the same set are adjacent.

A projection which maps a sphere (or spheroid) onto a plane. Map projections are generally classified into groups according to common properties (cylindrical vs. conical, ...

Linear Algebra

Topology

Go is played on a 19×19 grid, with pieces being placed at the intersections of grid lines, rather than in the middle of them. Go boards have a number of peculiarities, ...

A graph H is a minor of a graph G if a copy of H can be obtained from G via repeated edge deletion and/or edge contraction. The Kuratowski reduction theorem states that any ...

A totalistic cellular automaton is a cellular automata in which the rules depend only on the total (or equivalently, the average) of the values of the cells in a ...

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