Spiral Chains: The Proofs of Tait's and Tutte's Three-Edge-Coloring Conjectures
| dc.creator | Cahit, I. | |
| dc.date | 2005-07-06 | |
| dc.date.accessioned | 2026-07-07T05:21:27Z | |
| dc.date.available | 2026-07-07T05:21:27Z | |
| dc.description | In this paper we have shown without assuming the four color theorem of planar graphs that every (bridgeless) cubic planar graph has a three-edge-coloring. This is an old-conjecture due to Tait in the squeal of efforts in settling the four-color conjecture at the end of the 19th century. We have also shown the applicability of our method to another well-known three edge-coloring conjecture on cubic graphs. Namely Tutte's conjecture that "every 2-connected cubic graph with no Petersen minor is 3-edge colorable". Hence the conclusion of this paper implies another non-computer proof of the four color theorem by using spiral-chains in different context. | |
| dc.description | draft-paper, 14 pages, 8 figures | |
| dc.identifier | https://arxiv.org/abs/math/0507127 | |
| dc.identifier | http://arxiv.org/abs/math/0507127 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/75698 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C | |
| dc.title | Spiral Chains: The Proofs of Tait's and Tutte's Three-Edge-Coloring Conjectures | |
| dc.type | text |