✦ LIBER ✦

A (<5)-Colour Theorem for Planar Graphs

✍ Scribed by Hilton, A. J. W.; Rado, R.; Scott, S. H.

Book ID: 120094537
Publisher: Oxford University Press
Year: 1973
Tongue: English
Weight: 115 KB
Volume: 5
Category: Article
ISSN: 0024-6093
DOI: 10.1112/blms/5.3.302

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Theorem on Planar Graphs

✍ Ungar, P. 📂 Article 📅 1951 🏛 Oxford University Press 🌐 English ⚖ 204 KB

An algorithm for colouring perfect plana

An algorithm for colouring perfect planar graphs

✍ Iain A. Stewart 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 685 KB

A structural theorem for planar graphs w

A structural theorem for planar graphs with some applications

✍ Huiyu Sheng; Yingqian Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 264 KB

A theorem on paths in planar graphs

✍ Norishige Chiba; Takao Nishizeki 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views

C. Thomassen extended Tutte's theorem on cycles in planar graphs in the paper "A Theorem on Paths in Planar Graphs". This note corrects a flaw in his proof.

A theorem on paths in planar graphs

✍ Carsten Thomassen 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 394 KB 👁 1 views

We prove a theorem on paths with prescribed ends in a planar graph which extends Tutte's theorem on cycles in planar graphs [9] and implies the conjecture of Plummer (51 asserting that every 4-connected planar graph is Hamiltonian-connected.

Graphs, colourings, and the four-colour

Graphs, colourings, and the four-colour theorem

✍ Robert A. Wilson 📂 Library 📅 2002 🏛 Oxford University Press 🌐 English ⚖ 610 KB

The four-colour theorem is one of the famous problems of mathematics, that frustrated generations of mathematicians from its birth in 1852 to its solution (using substantial assistance from electronic computers) in 1976. The theorem asks whether four colours are sufficient to colour all conceivable