Some arithmetical restatements of the four color conjecture

DOI10.1016/S0304-3975(00)00115-8zbMath0979.05049WikidataQ123019814 ScholiaQ123019814MaRDI QIDQ5941259

Yu. V. Matiyasevich

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

planar graphsbinomial summationfour color conjecture

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The Riemann hypothesis as the parity of special binomial coefficients

Cites Work

• On a combinatorial expression concerning Fermat's Last Theorem
• An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
• Map coloring and the vector cross product
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Quickly excluding a planar graph
• The four-colour theorem
• An algebraic approach to the planar coloring problem
• A necessary and sufficient condition for primality, and its source
• Every Planar Map is Four Colorable
• A binomial representation of the 3x + 1 problem
• Thirteen Colorful Variations on Guthrie's Four-Color Conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some arithmetical restatements of the four color conjecture