2000 character limit reached
Klein Group And Four Color Theorem (1006.0276v2)
Published 2 Jun 2010 in math.CO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.
