Journal of Algebra, Number Theory: Advances and Applications[1] K. Appel and W. Haken, Every planar map is four colorable, Part I:
Discharging, Illinois J. Math. 21 (1977), 429-490.
[2] K. Appel, W. Haken and J. Koch, Every planar map is four
colorable, Part II: Reducibility, Illinois J. Math. 21 (1977),
491-567.
[3] K. Appel and W. Haken, Every planar map is four colorable,
Contemporary Mathematics, Amer. Math. Soc. 98 (1989).
[4] N. Cristofides, Graph Theory, An Algorithm Approaches, Academic
Press, London 1975.
[5] O. Ore, The Four Color Problem, Academic Press, New York, 1967.
[6] N. Robertson, D. P. Sanders, P. Seymour and R. Thomas, A new proof
of the four-colour theorem, Electron. Res. Announc. Amer. Math. Soc. 2
(1996), 17-25.
[7] T. L. Saaty and P. C. Kainen, The Four-Color Problem, Assault and
Conquest, McGraw-Hill, New York, 1977.
[8] G. Trigiante and D. Trigiante, On the Coloring of Maximal Planar
Graphs, In Proceeding II Int. Symposium on ‘Problemi
dell\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'Analisi e della Fisica
Matematica\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' held in Taormina Oct 1998,
ARACNE 2000.
[9] G. Trigiante and D. Trigiante, On the Constraints of Internal
Chains in Graph Coloring, Report of Math. Dept. University of
Florence, N. 19-2000.
