1. R. Beigel, D. Eppstein, 3-coloring in time O(1.3446n): a no-MIS algorithm, in: Proceedings of the FOCS'95, 1995, pp. 444–453. ECCC TR95-033, ftp://ftp.eccc.uni-trier.de/.
2. R. Beigel, D. Eppstein, 3-coloring in time O(1.3289n). ACM Computing Research Repository cs.DS/0006046, 2000.
3. Applied and Algorithmic Graph Theory;Chartrand,1993
4. D. Eppstein, Improved algorithms for 3-coloring, 3-edge-coloring and constraint satisfaction, in: Proceedings of the SODA'01, 2001, pp. 329–337. ACM Computing Research Repository cs.DS/0009006, 2001.
5. D. Eppstein, Small maximum independent sets and faster exact graph coloring, in: Proceedings of the WADS'01, Lecture Notes in Computer Science, vol. 2125, Springer, Berlin, 2001, pp. 462–470. ACM Computing Research Repository cs.DS/0011009, 2001.