✦ LIBER ✦
Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs
✍ Scribed by Eckhard Steffen
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 47 KB
- Volume
- 161
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
We follow the terminology and notion of . By a well known theorem of Vizing it follows that the chromatic index z'(G) of a cubic graph G is 3 or 4. If z'(G) = 4 we say that G is non-Tait-colourable.
Holroyd and Loupekine [1] defined a bottleneck in a non-Tait-colourable cubic graph G =