Klein Group And Four Color Theorem
arXiv:1006.0276
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.
20 pages, 23 figures