Publisher
Springer International Publishing
Reference20 articles.
1. Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Company, New York (1979)
2. Matula, D.W., Marble, G., Isaacson, J.D.: Graph colouring algorithms. In: Read, R.C. (ed.) Graph Theory and Computing, pp. 109–122. Academic Press, New York (1972)
3. Welsh, D.J.A., Powell, M.B.: An upper bound for chromatic number of a graph and its application to timetabling problem. Comput. J. 10, 85–86 (1967)
4. Chiba, N., Nishizeki, T., Saito, N.: A linear 5-coloring algorithm of planar graphs. J. Algorithms 2(4), 317–327 (1981)
5. Matula, D.W., Schiloach, Y., Tarjan, R.E.: Two linear algorithms for five coloring of planar graphs. STAN-CS-80-830 (1980)