𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Four-Colour Theorem

✍ Scribed by Neil Robertson; Daniel Sanders; Paul Seymour; Robin Thomas


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
658 KB
Volume
70
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the four-vertex theorem
✍ U. Pinkall πŸ“‚ Article πŸ“… 1987 πŸ› Springer 🌐 English βš– 371 KB
The colour theorems of Brooks and Gallai
✍ A.V. Kostochka; M. Stiebitz; B. Wirth πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 283 KB

One of the basic results in graph colouring is Brooks' theorem [-4] which asserts that the chromatic number of every connected graph, that is not a complete graph or an odd cycle, does not exceed its maximum degree. As an extension of this result, Gallai [6] characterized the subgraphs of k-colour-c