- 16,354 hits
- 3-edge coloring 4 4 color theorem 4ct Alfred Bray Kempe algorithm Brendan McKay Cahit spiral chains color coloring coloring maps colour cubic graphs different docker edge embedding Euler four Four color four color music four color problem four colors suffice four color theorem Francis Guthrie Fullerene graph graph coloring Graph isomorphism graphs representations Graph theory Gunnar Brinkmann Hamilton homeomorphic impasse isomorphic graphs Java Kempe Kempe chain Kenneth Appel map new features oeis pencil and paper plantri problem proof proper colorings sage sagemath tait Tait coloring theorem tutte Wolfgang Haken
Some rights reserved. Read here.
Tag Archives: Tait coloring
https://4coloring.wordpress.com/2016/10/16/four-color-theorem-a-fast-algorithm These are the OLD and NEW (last column) execution times on my new laptop: 100 – 196 vertices, 294 edges = 0 seconds – 0 seconds 200 – 396 vertices, 594 edges = 1 seconds – 0 seconds 300 – 596 vertices, 894 edges = … Continue reading
I transformed the really bad case into a rectangular map to play with the Java program and Kempe random switches. Here is the graph with the two edges to connect: The two edges marked with the X, have to be … Continue reading
A new edge 12-7 that connects the edges 6-10 and 32-15. With this case seems that infinite random switches throughout the entire graph do not solve the impasse, which is really really really bad.
Experimenting with the Python program, I have found that if you have an F5 impasse, a single switch may not be enough to solve the impasse. It means: counterexample found. This is a bad news, since I believed that a … Continue reading
This post follows directly the previous one. I’m down to a single case to prove (pag. 3). I think I should move to Java coding, implementing the entire algorithm: map reduction (removing edges), color reduced map, restore of edges one at a … Continue reading