Tutte's edge-colouring conjecture (Q1369658)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Tutte's edge-colouring conjecture |
scientific article |
Statements
Tutte's edge-colouring conjecture (English)
0 references
20 October 1997
0 references
In 1966 Tutte conjectured that every 2-connected cubic graph not containing the Petersen graph as a minor is 3-edge-colourable. The conjecture is still open, but it is shown in this paper that it is true in general, provided that it is true for two special kinds of cubic graphs that are almost planar.
0 references
cubic graph
0 references
Petersen graph
0 references