1. M. R. Garey, D. S. Johnson, and L. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci., 1 (1976), pp. 237–267.
2. P. J. Heawood, On the four-color map theorem, Quart. J. Pure Math. 29 (1898) 270–285
3. O. Ore, The Four-Color Problem, Academic Press, New York, Chapter 13 (1967).
4. R. Steinberg, The state of the three color problem [in:], Quo Vadis, Graph Theory? Annals of Discrete Mathematics, 55 (1993) 211–248
5. H. Król, On a sufficient and necessary condition of 3-colorableness for the planar graphs. I, Prace Naukowe Inst. Mat. i Fiz. Teoret. P. Wr., Seria Studia i Materialy, No. 6 Grafy i hypergrafy, (1972) 37–40