- 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: Kempe
This is what I want to try: Select an F2, F3 or F4 preferably when it is near an F5 and remove the edge that joins the two faces Analyse also the balance of the Euler’s identity when removing edges, to … Continue reading
The algorithm I use to color graphs works pretty well … BUT: Sometimes (very rarely) it gets into an infinite loop where also random Kempe color switches (around the entire graph) do NOT work. The good is, if I reprocess … Continue reading
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