𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Theorem on Planar Graphs

✍ Scribed by Ungar, P.


Book ID
120099245
Publisher
Oxford University Press
Year
1951
Tongue
English
Weight
204 KB
Volume
s1-26
Category
Article
ISSN
0024-6107

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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.

The theorem on planar graphs
✍ John W Kennedy; Louis V Quintas; Maciej M SysΕ‚o πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 927 KB
A (<5)-Colour Theorem for Planar Graphs
✍ Hilton, A. J. W.; Rado, R.; Scott, S. H. πŸ“‚ Article πŸ“… 1973 πŸ› Oxford University Press 🌐 English βš– 115 KB
Short proofs of coloring theorems on pla
✍ Borodin, Oleg V.; Kostochka, Alexandr V.; LidickΓ½, Bernard; Yancey, Matthew πŸ“‚ Article πŸ“… 2014 πŸ› Elsevier Science 🌐 English βš– 373 KB