Tutte's edge-colouring conjecture
type: Item
instance of: scholarly article
title: Tutte's edge-colouring conjecture
zbMATH Open document ID: 0883.05055
author: Neil Robertson
author: Robin Thomas
author: Paul Seymour
published in: Journal of Combinatorial Theory. Series B
publication date: 1997-10-20T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1076877
zbMATH Keywords: cubic graph
zbMATH Keywords: Petersen graph
reviewed by: Chris Jagger
MaRDI profile type: Publication
OpenAlex ID: W1982423514
cites work: Decomposition of snarks
cites work: Construction of class two graphs with maximum vertex degree three
cites work: Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
cites work: C-Minimal Snarks
cites work: Disjoint paths in graphs
cites work: On the algebraic theory of graph colorings
DOI: 10.1006/JCTB.1997.1752
description: scientific article; zbMATH DE number 1076877