### 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: color

## Four color theorem: deep analysis of a map

I would like to implement a brute force algorithm to search ALL the different colorings of a map. Here is the question on: math.stackexchange.com In terms of graph theory I’d like to find all four colorings of the vertices of … Continue reading

Posted in Uncategorized
Tagged 4, algorithm, color, colour, different, four, proper colorings, theorem
Leave a comment

## Four color theorem: java application update

I new version of the java application is available with these new features: Save .png images and restore maps from the image itself (using metadata within it) Force coloring of faces to find different colorings of the same map Faster … Continue reading

Posted in Uncategorized
Tagged 4, color, colour, four, four color theorem, Java, new features, theorem
Leave a comment

## Four color theorem: hello world

These translations have been taken from wikipedia, starting from http://en.wikipedia.org/wiki/Four_color_theorem. I was just curious to see if people search for the “four color theorem” only in english. Teorema dei quattro colori Problém čtyř barev Firfarveproblemet Vier-Farben-Satz قضیه چهاررنگ Théorème des … Continue reading

## 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