✦ LIBER ✦

A numerical equivalent of the four color map Problem

✍ Scribed by Hassler Whitney

Publisher: Springer Vienna
Year: 1936
Tongue: English
Weight: 298 KB
Volume: 45
Category: Article
ISSN: 0026-9255
DOI: 10.1007/bf01707988

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Numerical study of a four-dimensional ma

Numerical study of a four-dimensional mapping

✍ C. Froeschle 📂 Article 📅 1973 🏛 Springer Netherlands 🌐 English ⚖ 98 KB

Some properties of non-bicolorable hyper

Some properties of non-bicolorable hypergraphs and the four-color problem

✍ Claude Berge 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 461 KB

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

On the edge-coloring problem for a class

On the edge-coloring problem for a class of 4-regular maps

✍ F. Jaeger; H. Shank 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 300 KB 👁 1 views

## Abstract A (plane) 4‐regular map __G__ is called __C__‐simple if it arises as a superposition of simple closed curves (tangencies are not allowed); in this case σ (__G__) is the smallest integer __k__ such that the curves of __G__ can be colored with __k__ colors in such a way that no two curves

Erratum: On the edge-coloring problem fo

Erratum: On the edge-coloring problem for a class of 4-regular maps

✍ F. Jaeger; H. Shank 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 37 KB 👁 1 views

On p. 272 of the above article, paragraph # 3 is incomplete. It should read as the following: Hence to prove Proposition 4 it is enough to show that the edges of Q 4 can be colored with 4 colors in such a way that each square has one edge of each color. Such a coloring is displayed on the following

Performance of four numerical schemes fo

Performance of four numerical schemes for the unconfined flow (nonlinear Boussinesq) problem

✍ Taigbenu, Akpofure 📂 Article 📅 1988 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 357 KB 👁 1 views

Numerical experiments are performed on four schemes of the boundary element method (BEM) for the unconfined flow (nonlinear Boussinesq) problem with a view to determining the scheme that gives the best performance. The performance measure of a scheme for a particular problem reflects the trade-off b