Re: Doubt - Proof of Four Color Theorem

On 2 Sep 2005 03:19:03 -0700, anand_bheemaraju@xxxxxxxxx wrote:

>just forgot to add this -
>9) in my program there is no need to regularize the graph G.
>10) it works fine with graphs of maximum degree even > 6.

If you can _prove_ your algorithm always works for planar graphs, then
that would be a proof of the 4-color theorem, but it's a trap -- your
time would be much better spent doing independent study.

However, if you feel strongly that you have a proof, then at least
make sure that the proof doesn't imply a 4 coloring of graphs which
you know are not 4-colorable. For example, if the proof doesn't make
use of planarity, that should tell you that something is wrong.

quasi
.

Relevant Pages