- 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: four color theorem
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 moved all code under github here: https://github.com/stefanutti I organized the folders a little betters (different github repos) I’m experimenting docker to deliver & deploy the Java and Python software I’ll also try to integrate a deep learning module, based on … Continue reading
For the decomposition of a graph representing a map, I’m trying to use different algorithms to select the edge to remove. The question is: When you have multiple valid choices, which is the best edge to select … if any? Some basic … Continue reading
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
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.