- 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: Cahit spiral chains
In this new version of the software you can manually color the edges of a map with three colors (RGB) and apply Kempe coloring switch on a Kempe edge chain (path or loop) (http://en.wikipedia.org/wiki/Kempe_chain). Advertisements
😦 Too many more things to do and little time: Filter out duplicates. I finally found a java library to efficiently filter out all isomorphic graphs. It is a library part if the sspace project. Using it I will be able … Continue reading
Now the application is able to find all spiral chains of a graph. I still need to: Implement the Cahit coloring algorithm using the spiral chains Add some additional features to the Java application Modify the settings to color the … Continue reading