The goal is to figure out how to color the nodes of some network (or graph, as mathematicians call them) so that no two connected nodes share the same color. Depending on the context, such a coloring ...

Their strategy for coloring the large edges relied on a simplification. They reconfigured these edges as the vertices of an ordinary graph (where each edge only connects two vertices). They colored ...

The graph below shows the total number of publications each year in Graph Coloring and Planar Graphs. References [1] 2-Distance Choosability of Planar Graphs with a Restriction for Maximum Degree .

The graph below shows the total number of publications each year in Graph Coloring and Chromatic Number. References [1] On the Chromatic Number of (P5, C5, Cricket)-Free Graphs .