DANZER-GRüNBAUM'S THEOREM REVISITED
✍ Scribed by Károly Bezdek; Grigoriy Blekherman
- Book ID
- 110216884
- Publisher
- Springer Netherlands
- Year
- 2000
- Tongue
- English
- Weight
- 374 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0031-5303
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A simple proof of Grfinbaum's theorem on the 3-colourability of planar graphs having at most three 3-cycles is given, which does not employ the colouring extension. In 1958, Gr6tzsch I-5] proved that every planar graph without cycles of length three is 3-colourable. In 1963, Griinbaum [6] extended
Purdy's generalization of Griinbaum's gap conjecture is roved for all arrangements w&h a sufficiently high maximum number of concurrent lines. We also improve Purdy's bounds for the general theorem and establish two lower bounds for h(A) for all arrangements.