Chromatic number of random graphs: an approach using a recurrence relation

Yayoi Abe, Auna Setoh, Gen Yoneda

The vertex coloring problem to find chromatic numbers is known to be unsolvable in polynomial time. Although various algorithms have been proposed to efficiently compute chromatic…