Tutte's three-edge-coloring conjecture for cubic graphs without a Petersen minor

Let GG be a 22-connected cubic graph with no Petersen minor. A proper three-edge-coloring assigns one of three colors to each edge so that edges incident with the same vertex receive different colors. Tutte's conjecture. Every 22-connected cubic graph with no Petersen minor is 3-edge colorable. The conjecture extends the four color theorem beyond planar graphs and implies three-edge-colorability for several classes of non-planar cubic graphs. It was eventually settled by a series of papers using the classical proof method of the four color theorem.

Sources & referencesView supporting material

Primary source

I. Cahit, “Spiral Chains: The Proofs of Tait's and Tutte's Three-Edge-Coloring Conjectures”, arXiv:math/0507127 (2005).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.