Actually coloring the border solves Four Color Problem of a map.

(append) I finally prooved that any 3-regular graph which has no loop is edge-3-colorable, even when the graph is not planar. using vertex-edge matrix over binary field {0,1}. This leads that four colour theorem can be proved without computers.

свернуть