In this way, the map coloring problem becomes a graph coloring problem: Color the vertices so neighbors are different colors. The minimum number of colors is called the chromatic number of the graph.

any map can be colored using only four colors so that no two adjacent countries have the same color. The exact sizes and shapes of the countries don’t matter, so mathematicians can translate the ...

Erdős, Faber, and Lovász focused their conversation on hypergraphs, a promising new idea in graph theory at the time ... For instance, edge-coloring problems become harder with hypergraphs.

In computer science, the graph coloring problem is a classic. Inspired by the map-coloring problem ... at the 2021 Conference on Learning Theory, Moore and his collaborators describe a new ...