✦ LIBER ✦

Signed Diagonal Flips and the Four Color Theorem

✍ Scribed by Shalom Eliahou

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 153 KB
Volume: 20
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1999.0312

No coin nor oath required. For personal study only.

✦ Synopsis

We introduce a signed version of the diagonal flip operation. We then formulate the conjecture that any two triangulations of a given polygon may be transformed into one another by a signable sequence of diagonal flips. Finally, we show that this conjecture, if true, would imply the four color theorem.

📜 SIMILAR VOLUMES

The four color theorem has been proved

📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 26 KB

On the 21st of June 1976, which was the 48th birthday of Wolfgang Haken, he and Kenneth Appel (with the aid of John Koch) completed their proof of the Four Color Theorem. In recognition of their momentous achievement, the Journal ofGruph Theory presents two articles (by Haken and by Frank Bernhart)

A digest of the four color theorem

✍ Frank R. Bernhart 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 949 KB

## Abstract A major event in 1976 was the announcement that the Four Color Conjecture (4CC) had at long last become the Four Color Theorem (4CT). The proof by W. Haken, K. Appel, and J. Koch is published in the __Illinois Journal of Mathematics__, and their two‐part article outlines the nature and

The combinatorial map color theorem

✍ Gerhard Ringel 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 522 KB

## Abstract This paper is written in the spirit of the author's book: __Map Color Theorem__ (1974). We try to develop the Map Color Theorem in a combinatorial way, circumventing the unwieldy embedding theory. Similar (but not identical) generalizations have recently and independently been developed

On Four Colored Sets with Nondecreasing

On Four Colored Sets with Nondecreasing Diameter and the Erdős–Ginzburg–Ziv Theorem

✍ David J. Grynkiewicz 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 197 KB

A set X; with a coloring D: X ! Z m ; is zero-sum if P x2X DðxÞ ¼ 0: Let f ðm; rÞ (let f zs ðm; 2rÞ) be the least N such that for every coloring of 1; . . . ; N with r colors (with elements from r disjoint copies of Z m ) there exist monochromatic (zero-sum) m-element subsets B 1 and B 2 ; not neces

Color science applications of the Binet–

Color science applications of the Binet–Cauchy theorem

✍ Michael H. Brill 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 81 KB 👁 2 views

A new proof of the 6 color theorem

✍ Oleg V. Borodin 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 579 KB

## Abstract In 1965 Ringel raised a 6 color problem for graphs that can be stated in at least three different forms. In particular, is it possible to color the vertices and faces of every plane graph with 6 colors so that any two adjacent or incident elements are colored differently? This 6 color p