@article{Byskov_2002, title={Chromatic Number in Time O(2.4023^n) Using Maximal Independent Sets}, volume={9}, url={https://tidsskrift.dk/brics/article/view/21760}, DOI={10.7146/brics.v9i45.21760}, abstractNote={In this paper we improve an algorithm by Eppstein (2001) for finding the chromatic number of a graph. We modify the algorithm slightly, and by using a bound on the number of maximal independent sets of size k from our recent paper (2003), we prove that the running time is O(2.4023^n). Eppstein’s algorithm runs in time O(2.4150^n). The space usage for both algorithms is O(2^n).}, number={45}, journal={BRICS Report Series}, author={Byskov, Jesper Makholm}, year={2002}, month={Dec.} }