Abstract
Tutte made the conjecture in 1966 that every 2-connected cubic graph not containing the Petersen graph as a minor is 3-edge-colourable. The conjecture is still open, but we show that it is true, in general, provided it is true for two special kinds of cubic graphs that are almost planar.
Original language | English (US) |
---|---|
Pages (from-to) | 166-183 |
Number of pages | 18 |
Journal | Journal of Combinatorial Theory. Series B |
Volume | 70 |
Issue number | 1 |
DOIs | |
State | Published - May 1997 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics