How to prove Tait's theorem about planar cubic bridgeless graph being 3-edge-colorable?

The two problems of three-edge-coloring and four-face-coloring for the same map are equivalent.

A proof of this equivalency can be round here: http://www.mathpuzzle.com/4Dec2001.htm. Search for "material added 19 November 2001" within the page.

Since the four color problem has been already proved, also the three edge coloring is true.

Tags:

Graph Theory

Coloring

Related

Analytic continuation of harmonic series Rectangles in a $n \times n$ grid and the sum of the first $n$ cubes: a geometric connection? Do all projections matrices take this form? Why is $\mathbb{F}_{9}^*$ a multiplicative group Showing $\sum_{k=1}^{nm} \frac{1}{k} \approx \sum_{k=1}^{n} \frac{1}{k} + \sum_{k=1}^{m} \frac{1}{k}$ How is the missing digit calculated? Why is the negation of the statement $\exists x P(x)$ given by $\forall x (\neg P(x))$ and not $\not \exists x P(x)$? Does Cauchy's theorem's hold if we only assume boundedness? Integral for the New Year $2019$! Factors in a different base $\ 2b^2\!+\!9b\!+\!7\,\mid\, 7b^2\!+\!9b\!+\!2$ Evaluate $\sum\limits_{n=0}^{\infty}(-1)^n\sum\limits_{j=0}^{k}{k \choose j}\frac{(-1)^j}{2n+2j+1}$ If $p$ is prime, then $x^2 +5y^2 = p \iff p\equiv 1,9 $ mod $(20)$.

Recent Posts