1. R. Beigel and D. Eppstein. 3-coloring in time
$$
\mathcal{O}(1.3446^n )
$$
: a no-MIS algorithm. Proc. 36th Symp. Foundations of Computer Science, pp. 444–453. IEEE, October 1995,
ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/1995/TR95-033/index.html
.
2. R. Beigel and D. Eppstein. 3-coloring in time
$$
\mathcal{O}(1.3289^n )
$$
. ACM Computing Research Repository, June 2000, cs.DS/0006046.
3. C. Croitoru. On stables in graphs. Proc. 3rd Coll. Operations Research, pp. 55–60. Babes-Bolyai Univ., Cluj-Napoca, Romania, 1979.
4. D. Eppstein. Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. Proc. 12th Symp. Discrete Algorithms, pp. 329–337. ACM and SIAM, January 2001, cs.DS/0009006.
5. E. L. Lawler. A note on the complexity of the chromatic number problem. Inf. Proc. Lett. 5(3):66–67, August 1976.