The theory of coloring deals with the problem of labeling parts of a graph to comply with certain rules and avoid specific conflicts. For example, imagine you wanted to color each dot below so that ...

Let G be a graph and k a natural number. A k-coloring of G is a map c that maps the vertices of G into the set {1, 2, ..., k} (whose elements are called colors) such that no two adjacent vertices are ...

In the fall of 1972, Vance Faber was a new professor at the University of Colorado. When two influential mathematicians, Paul Erdős and László Lovász, came for a visit, Faber decided to host a tea ...

Have you ever tried to do the brainteaser below, where you have to connect the dots to make the outline of a house in one continuous stroke without going back over your lines? Or perhaps you've ...