✦ LIBER ✦
On 3-regular graphs having crossing number at least 2
✍ Scribed by Dan McQuillan; R. Bruce Richter
- Publisher
- John Wiley and Sons
- Year
- 1994
- Tongue
- English
- Weight
- 414 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We give a planar proof of the fact that if G is a 3‐regular graph minimal with respect to having crossing number at least 2, then the crossing number of G is 2.