Tutte's edge-colouring conjecture

Neil Robertson, Paul Seymour, Robin Thomas

Research output: Contribution to journalArticlepeer-review

38 Scopus citations


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 languageEnglish (US)
Pages (from-to)166-183
Number of pages18
JournalJournal of Combinatorial Theory. Series B
Issue number1
StatePublished - May 1997
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Tutte's edge-colouring conjecture'. Together they form a unique fingerprint.

Cite this