𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Claude Berge

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
461 KB
Volume
65
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Some probabilistic restatements of the F
Some probabilistic restatements of the Four Color Conjecture
✍ Yuri Matiyasevich πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 99 KB

## Abstract With every triangulation of sphere, we associate a probabilistic space in a natural way and define several random events. The Four Color Conjecture (4CC) turns out to be equivalent to different statements about positive correlation among some pairs of these events. Β© 2004 Wiley Periodic

Some undecidable problems involving the
Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
✍ Stefan A. Burr πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 477 KB

Certain problems involving the coloring the edges or vertices of infinite graphs are shown to be undecidable. In particular, let G and H be finite 3-connected graphs, or triangles. Then a doubly-periodic infinite graph F is constructed such that the following problem is undecidable: For a coloring o