Determining the chromatic number is an NP-hard problem in general, yet research has made substantial inroads by focusing on specific graph classes defined by restrictions, such as the exclusion of ...

The quantum computing revolution draws ever nearer, but the need for a computer that makes correctable errors continues to hold it back.

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 .