𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Towards the proof of a theorem of Grünbaum

✍ Scribed by A. Ya. Petrenyuk


Book ID
112478636
Publisher
Springer
Year
1972
Tongue
English
Weight
118 KB
Volume
23
Category
Article
ISSN
0041-5995

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


A new proof of Grünbaum's 3 color theore
✍ O.V. Borodin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 307 KB

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

Proof of a conjecture of Burr, Grünbaum,
✍ Jacob E. Goodman 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 926 KB

We establish a duality principle for arrangements of pseudolines in the projective plane, and thereby prove the conjecture of Burr, Griinbaum, and Sloane that the solution T(p) of the "orchard problem" for pseudoline arrangements and the solution r(p) of the dual problem xe equa1.