Some probabilistic restatements of the four color conjecture

Journal of Graph Theory

Volumn 46, Issue 3, 2004, Pages 167-179

  Matiyasevich, Yuri ^a  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

Four Color Conjecture; Graph polynomial; Tait coloring

Indexed keywords

COLOR; CORRELATION METHODS; GRAPH THEORY; POLYNOMIALS; RANDOM PROCESSES; THEOREM PROVING;

FOUR COLOR CONJECTURE; GRAPH POLYNOMIAL; RANDOM EVENTS; TAIT COLORING;

PROBABILITY;

EID: 3042523213     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.10178     Document Type: Article

References (22)

1. N. Alon and M. Tarsi, A note on graph colorings and graph polynomials, J Combin Theory B 70 (1997), 197-201.
2. K. Appel and W. Haken, Every planar map is four colorable. Part I. Discharging, Illinois J Mathematics 21 (1977), 429-490.
3. K. Appel, W. Haken, and J. Koch, Every planar map is four colorable. Part II. Reducibility, Illinois J Mathematics 21 (1977), 491-567.
4. K. Appel and W. Haken, Every planar map is four colorable, AMS Contemporary Mathematics, 98, Amer Math Soc Providence, RI, 1989.
5. Yves Colin de Verdiere, On a new graph invariant and a criterion for planarity, AMS Contemporary Mathematics, 147, Amer Math Soc Providence, RI, 1993.
6. T. Huffman, J. Mitchem, and E. Schmeichel, On edge-coloring graphs, Ars Combinatoria 33 (1992), 119-128.
7. T. R. Jensen and B. Toft, Graph coloring problems, Wiley & Sons, New York, 1995.
8. P. C. Kainen, Is the four color theorem true?, Geombinatorics 3 (1993), 41-56.
9. L. Kaufmann, Map coloring and the vector cross product, J Combin Theory B 48 (1990), 145-154.
10. L. H. Kauffman, Combinatorial recoupling theory and 3-manifold invariants. Low-dimensional topology and quantum field theory (Cambridge, 1992), (NATO Adv Sci Inst Ser B Phys, 315), Plenum, New York, 1993, pp. 1-17.
11. L. H. Kauffman, Spin networks, topology and discrete physics, Adv Ser Math Phys 17, World Sei Publishing, River Edge, NJ, 1994, 234-274.
12. L. H. Kauffman and H. Saleur, An algebraic approach to the planar coloring problem, Commun Math Phy 152 (1993), 565-590.
13. Yu. Matiyasevich, Problem 21 (in Russian), Combinatorial and asymptotical analysis, issue 2, G. P. Egorychev (Editor), Krasnoyarskii State University, Krasnoyarsk, 1977, pp. 178-179; MR 58 #27504, ZB1 431, 00010.
14. Yu. Matiyasevich, A polynomial related to colourings of triangulation of sphere. Available at: URL: http://logic.pdmi.ras.ru/~yumat/Journal/ Triangular/triang.htm. Mirrored at: http://www.informatik.uni-stuttgart.de/ ifi/ti/personen/Matiyasevich/Journal/Triangular/triang.htm.
15. Yu. Matiyasevich, Some arithmetical restatements of the four color conjecture, Theoretical Computer Sci 257 (2001), 167-183 (a version of this paper is available via URL: http://logic.pdmi.ras.ru/~yumat/Journal/ jcontord.htm, mirrored at http://www.informatik.uni-stuttgart.de/ifi/ti/ personen/Matiyasevich/Journal/jcontord.htm).
16. Yu. V. Matiyasevich, Some algebraic methods for calculation of the number of colorings of a graph (in Russian), Zapiski Nauchnykh Seminarov POMI 283 (2001), 193-205 (available via URL http://www.pdmi.ras.ru/znsl/2001/ v283.html).
17. Yu. V. Matiyasevich, A probabilistic equivalent to the four color conjecture (in Russian), Teoriya Veroyatnostei i ee Primeneniya 48 (2003), 411-416.
18. O. Ore, The four-color problem, Academic Press, New York-London, 1967.
19. N. Robertson, D. Sanders, P. Seymour, and R. Thomas, The four-colour theorem, J Combin Theory B 70 (1997), 2-44.
20. R. Thomas, An update on the four-colour theorem, Notices of the AMS 45 (1998), 848-859 (available via URLs: http://www.ams.org/noticies/199807/ thomas.{ps,pdf}).
21. T. L. Saaty, Thirteen colorful variations on Guthrie's four-color conjecture, Am Mathematical Monthly 79 (1972), 2-43.
22. T. L. Saaty and P. C. Kainen, The four-color problem, McGraw-Hill, Düsseldorf, 1977.