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

The Black and White Coloring (BWC) problem is initially described in 1. There is an undirected graph G = (V, E), where V is a set containing n vertices, and E is a set containing l edges. The vertices ...

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

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