Graphs are everywhere. ... In theory, it cannot be ruled out that the algorithms might run for longer than the age of the universe. But in practice, many algorithms seem to work just fine.

The graph below shows the total number of publications each year in Anti-Ramsey Theory in Graphs. References [1] Rainbow disjoint union of P 4 and a matching in complete graphs .

Refining with colors. Mathematicians have developed various strategies to compare graphs. Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time.