### Blog Stats

- 16,763 hits

### Last visits

- 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

### Blogroll

### Comments

### Meta

# Tag Archives: coloring

## Four color theorem: what next?

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

Posted in math
Tagged 4 color theorem, coloring, four color theorem, Kempe, Kenneth Appel
Leave a comment

## Four color theorem: Infinite switches are not enough :-( :-(

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.

## Four color theorem: Tait edge coloring video

And here is the video that shows how to get a Tait colored map (graph) from a rectangular map.

## Four color theorem: Tait edge coloring

From Wikipedia: “The four color theorem, on vertex coloring of planar graphs, is equivalent to the statement that every bridgeless 3-regular planar graph is of class one (Tait 1880). This statement is now known to be true, due to the … Continue reading