Title of article
Tutteʹs Edge-Colouring Conjecture
Author/Authors
Robertson، نويسنده , , Neil and Seymour، نويسنده , , Paul and Thomas، نويسنده , , Robin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
18
From page
166
To page
183
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.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1997
Journal title
Journal of Combinatorial Theory Series B
Record number
1526248
Link To Document