Klein Group And Four Color Theorem
Combinatorics
2010-06-04 v2
Abstract
In this work methods of construction of cubic graphs are analyzed and a theorem of existence of a colored disc traversing each pair of linked edges belonging to an elementary cycle of a planar cubic graph is proved.
Cite
@article{arxiv.1006.0276,
title = {Klein Group And Four Color Theorem},
author = {Sergey Kurapov},
journal= {arXiv preprint arXiv:1006.0276},
year = {2010}
}
Comments
20 pages, 23 figures