By revisiting the famous problem — which was controversially solved in the 1970s with the help of computers — mathematicians have gained important new insights into the nature of graphs.

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

Graph colouring, the assignment of colours to the vertices of a graph so that no two adjacent vertices share the same colour, represents a canonical NP-hard combinatorial optimisation problem with ...

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

This is a coloring activity for a set of 10 problems on finding the length of a segment on a graph. There are two coloring activities on the distance formula. The other one has two ordered pairs and ...