Some arithmetical restatements of the Four Color Conjecture

Theoretical Computer Science

Volumn 257, Issue 1-2, 2001, Pages 167-183

  Matiyasevich, Yuri ^a  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

Binomial summation; Four colours; Planar graphs

Indexed keywords

GRAPH THEORY; POLYNOMIALS; THEOREM PROVING;

FOUR COLOR CONJECTURE;

DIGITAL ARITHMETIC;

EID: 0034923603     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00115-8     Document Type: Article

References (29)

1. Every planar map is four colorable, Part I. Discharging
2. Every planar map is four colorable, Part II. Reducibility
3. Every planar map is four colorable, with the collaboration of D. Koch
4. On a new graph invariant and a criterion for planarity
5. Hilbert's tenth problem. Diophantine equations: Positive aspects of a negative solution
6. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter systeme. I
7. On edge-coloring graphs
8. On a combinatorial expression concerning Fermat's Last Theorem
9. Is the four color theorem true?
10. Map coloring and the vector cross product
11. Combinatorial recoupling theory and 3-manifold invariants
12. Spin networks, topology and discrete physics
13. An algebraic approach to the planar coloring problem
14. Über die ergänzungssätze zu den allgemeinen reciprocitätsgesetzen
15. A necessary and sufficient condition for primality, and its source
16. A binomial representation of the 3x+1 problem
17. A class of primality criteria formulated in terms of the divisibility of binomial coefficients
18. The origin of the four-color conjecture
19. The four-colour theorem
20. Quickly excluding a planar graph
21. An update on the four-colour theorem
22. Thirteen colorful variations on Guthrie's four-color conjecture
23. An algorithmic proof theory for hypergeometric (ordinary and "q") multisum/integral identities