TOPICS
Search

Search Results for ""


841 - 850 of 2690 for Heawood Four Color GraphSearch Results
A set of n magic circles is a numbering of the intersections of the n circles such that the sum over all intersections is the same constant for all circles. The above sets of ...
A generalized mobile automaton is a generalization of the mobile automaton in which the automaton may have more than one active cell. Generalized mobile automata allow for ...
A 4-state two-dimensional Turing machine invented in the 1980s. The ant starts out on a grid containing black and white cells, and then follows the following set of rules. 1. ...
A generalized dodecagon is a generalized polygon of order 12. GD(1,2) is the (3,12)-cage graph, more commonly known as the Tutte 12-cage. GD(2,1) is the line graph of the ...
A configuration of 12 planes and 12 points such that six points lie in every plane and six planes pass through every point. Alternatively, the configuration consists of 16 ...
A theorem due to Conway et al. (1997) which states that, if a positive definite quadratic form with integer matrix entries represents all natural numbers up to 15, then it ...
Let G be a graph and S a subgraph of G. Let the number of odd components in G-S be denoted S^', and |S| the number of graph vertices of S. The condition |S|>=S^' for every ...
The uniform polychora are four-dimensional analogs of the uniform polyhedra. In fact, the uniform polyhedra are cells of the uniform polychora. There are more than 8000 known ...
A Möbius ladder, sometimes called a Möbius wheel (Jakobson and Rivin 1999), of order n is a simple graph obtained by introducing a twist in a prism graph of order n that is ...
Any nontrivial, closed, simple, smooth spherical curve dividing the surface of a sphere into two parts of equal areas has at least four inflection points.
1 ... 82|83|84|85|86|87|88 ... 269 Previous Next

...