✦ LIBER ✦
A cubic 3-connected graph having no cycle through given 10 vertices has the “Petersen form”
✍ Scribed by A. K. Kelmans; M. V. Lomonosov
- Publisher
- John Wiley and Sons
- Year
- 1982
- Tongue
- English
- Weight
- 55 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
It has been proved [1,2] that in a cubic 3‐connected graph any 9 vertices lie on a common cycle.