Tutte's edge-colouring conjecture

DOI10.1006/jctb.1997.1752zbMath0883.05055OpenAlexW1982423514MaRDI QIDQ1369658

Robin Thomas, Neil Robertson, P. D. Seymour

Publication date: 20 October 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/57977c01c8552029866cbc119db1e28435eccea4

zbMATH Keywords

cubic graphPetersen graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (20)

Three-edge-colouring doublecross cubic graphs ⋮ Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights. ⋮ A survey on flows in graphs and matroids ⋮ Hypohamiltonian snarks have a 5-flow ⋮ Cyclically five-connected cubic graphs ⋮ Edge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms ⋮ Homomorphisms and edge-colourings of planar graphs ⋮ Solving Matching Problems Efficiently in Bipartite Graphs ⋮ Flow-Critical Graphs ⋮ On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs ⋮ Packing six \(T\)-joins in plane graphs ⋮ Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs ⋮ Odd 2-factored snarks ⋮ Edge-coloring almost bipartite multigraphs ⋮ Topological minors in line graphs -- a proof of Zha's conjecture ⋮ Graph edge coloring: a survey ⋮ The extremal function for Petersen minors ⋮ Cycle double covers and spanning minors. I ⋮ Nowhere-zero 4-flow in almost Petersen-minor free graphs ⋮ Excluded minors in cubic graphs

Cites Work

• Construction of class two graphs with maximum vertex degree three
• Disjoint paths in graphs
• C-Minimal Snarks
• Decomposition of snarks
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• On the algebraic theory of graph colorings

This page was built for publication: Tutte's edge-colouring conjecture