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 ...

In 1950 Edward Nelson, then a student at the University of Chicago, asked the kind of deceptively simple question that can give mathematicians fits for decades. Imagine, he said, a graph — a ...

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 ...

A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof. Four years ago, the mathematician Maria Chudnovsky faced an all-too ...

Graph labeling and colouring constitute a vibrant area of combinatorial mathematics concerned with the systematic assignment of discrete labels or colours to graph elements—typically vertices, edges ...

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 ...