Doubt - Proof of Four Color Theorem

Hello,
I am Anand , the same undergraduate from India who had tried to
present a fallacious proof for Four Color Theorem.
I have now written a C++ Program to color all the vertices of any
planar graph (to be verified by user) using 4 or less colors.You will
find the program at
http://www.cjb.cc/members/anandbh/FOUR_COLOR.txt
The program first builds a graph and then colors the vertices one
by one using 4 or less colors , using my algorithm.To give input to the
program i.e. to build your graph , you need to remember two things i.e.
1)all the vertices are named (indexed) from 1 to n.
(given that there are n vertices)
2)output will be in the format:
nameOfVertex - ColorCode
{ColorCode is say 1-blue , 2-red , 3-green , 4-yellow)

Now my view to the proof is this , first find the dual of the
given graph and then remove all the self loops and parallel edges in
the dual graph.Now use the above program (algorithm) to color the
vertices of the dual graph. Thereby you are properly coloring the
regions of the original graph.

Can I consider this as a proof for the Four Color Theorem ?

regards,
anand b

.

Relevant Pages

  • Re: Doubt - Proof of Four Color Theorem
    ... > I am Anand, the same undergraduate from India who had tried to ... > planar graph using 4 or less colors.You will ... > The program first builds a graph and then colors the vertices one ... > Can I consider this as a proof for the Four Color Theorem? ...
    (sci.math)
  • Re: Doubt - Proof of Four Color Theorem
    ... >> I am Anand, the same undergraduate from India who had tried to ... >> The program first builds a graph and then colors the vertices one ... >> Can I consider this as a proof for the Four Color Theorem? ... draw a line joining points pi and pj that intersects the common edge ...
    (sci.math)
  • Re: Proving the four color theorem
    ... I have recently stumbled into the four color theorem and did some research ... "The dual of a fully-triangulated planar graph is a cubic planar graph. ...
    (sci.math)
  • Re: Four color theorem: why this is not a proof and pointer to simple explanations
    ... spending some time drawing colored maps, he made a connection with ... Graph theory is a fascinating subject, one that I wish I had ... You've got plenty of comments on 4CT (the Four Color Theorem). ... K5-e and K3,3-e are planar for any e. ...
    (sci.math)
  • Re: Proving the four color theorem
    ... I have recently stumbled into the four color theorem and did some research ... on the internet to learn about previous attempts to prove it. ... "The dual of a fully-triangulated planar graph is a cubic planar graph. ...
    (sci.math)