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.
Recommendations
Cites work
Cited in
(32)- Nowhere-zero 4-flow in almost Petersen-minor free graphs
- Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs
- Graph edge coloring: a survey
- The extremal function for Petersen minors
- The last temptation of William T. Tutte
- Excluded minors in cubic graphs
- Cyclically five-connected cubic graphs
- Odd 2-factored snarks
- Edge-coloring almost bipartite multigraphs
- Cycle double covers and spanning minors. I
- Three-edge-colouring doublecross cubic graphs
- Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights.
- Solving matching problems efficiently in bipartite graphs
- A survey on flows in graphs and matroids
- scientific article; zbMATH DE number 3889568 (Why is no real title available?)
- Hypohamiltonian snarks have a 5-flow
- Flow-Critical Graphs
- scientific article; zbMATH DE number 30752 (Why is no real title available?)
- scientific article; zbMATH DE number 1052840 (Why is no real title available?)
- Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs
- Topological minors in line graphs -- a proof of Zha's conjecture
- On sublinear approximations for the Petersen coloring conjecture
- Edge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms
- Proof of a conjecture of Plummer and Zha
- On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs
- The four color theorem and its aftermath
- Graph theory. Abstracts from the workshop held January 5--10, 2025
- A state sum for the total face color polynomial
- On cyclically 4-connected cubic graphs
- Removable edges and stability of 4-flow
- Homomorphisms and edge-colourings of planar graphs
- Packing six \(T\)-joins in plane graphs
This page was built for publication: Tutte's edge-colouring conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1369658)
