Search Results for ""

The edge chromatic number, sometimes also called the chromatic index, of a graph G is fewest number of colors necessary to color each edge of G such that no two edges ...

The study of map projections and the making of geographical maps.

Color each segment of a knot diagram using one of three colors. If 1. At any crossing, either the colors are all different or all the same, and 2. At least two colors are ...

The Heawood four-color graph is the 25-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's ...

A continuous map f:X->Y between topological spaces is said to be null-homotopic if it is homotopic to a constant map. If a space X has the property that id_X, the identity ...

If a map f:G->G^' from a group G to a group G^' satisfies f(ab)=f(b)f(a) for all a,b in G, then f is said to be an antihomomorphism.

A diffeomorphism is a map between manifolds which is differentiable and has a differentiable inverse.

The Soifer graph, illustrated above in a number of embeddings, is a planar graph on 9 nodes that tangles the Kempe chains in Kempe's algorithm and thus provides an example of ...

A characteristic of some systems making a transition to chaos. Doubling is followed by quadrupling, etc. An example of a map displaying period doubling is the logistic map.

Given a map f:S->T between sets S and T, the map g:T->S is called a left inverse to f provided that g degreesf=id_S, that is, composing f with g from the left gives the ...