An exact algorithm for graph coloring with polynomial memory

Abstract

In this paper, we give an algorithm that computes the chromatic number of a graph in O(5.283n) time and polynomial memory