Search Results for ""
91 - 100 of 787 for Map coloringSearch Results
The function f(x)=1-2|x|^(1/2) for x in [-1,1]. The natural invariant is rho(y)=1/2(1-y).
A generalized conformal mapping.
A mapping of a domain F:U->U to itself.
A linear transformation A:R^n->R^n is hyperbolic if none of its eigenvalues has modulus 1. This means that R^n can be written as a direct sum of two A-invariant subspaces E^s ...
Let gamma be a path in C, w=f(z), and theta and phi be the tangents to the curves gamma and f(gamma) at z_0 and w_0. If there is an N such that f^((N))(z_0) != 0 (1) ...
A class of area-preserving maps of the form theta_(i+1) = theta_i+2pialpha(r_i) (1) r_(i+1) = r_i, (2) which maps circles into circles but with a twist resulting from the ...
The best known example of an Anosov diffeomorphism. It is given by the transformation [x_(n+1); y_(n+1)]=[1 1; 1 2][x_n; y_n], (1) where x_(n+1) and y_(n+1) are computed mod ...
The empire problem, also known as the m-pire problem) asks for the maximum number of colors needed to color countries such that no two countries sharing a common border have ...
The bound for the number of colors which are sufficient for map coloring on a surface of genus g, gamma(g)=|_1/2(7+sqrt(48g+1))_| is the best possible, where |_x_| is the ...
The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...
...
View search results from all Wolfram sites (175456 matches)

