Talk:Five color theorem

From Wikipedia, the free encyclopedia

Mathematics Portal This article is within the scope of WikiProject Mathematics, which collaborates on articles related to mathematics.
Mathematics rating:	B Class	Mid Priority	Field: Discrete mathematics
Please update this rating as the article progresses, or if the rating is inaccurate. Click to show/hide comments. Please add to or update the comments to suggest improvements to the article. Really needs diagrams; needs a less technical overview. Tompw (talk) I believe that the link to John Koch points to a "different" John Koch -- which is an artist, not the algorithmist referred to. —Preceding unsigned comment added by 143.106.24.23 (talk) 14:15, 1 November 2007 (UTC)

[edit] Full proofs

This is not a proof outline; it is a full proof. Should we really be including entire proofs on Wikipedia? --Wzhao553 06:52, 7 February 2006 (UTC)

[edit] Linear-time algorithm

I added a description of the linear-time algorithm, based on the paper. The mechanics are a little bit complicated, especially the splicing together of adjacency lists during merging, and I hope to clarify this somehow in the future. Deco 00:23, 9 August 2006 (UTC)

It occurs to me that I'm not entirely sure if this algorithm is relevant to the five color theorem, although it's certainly relevant to five coloring of graphs. Maybe we should consider a move. Deco 00:25, 9 August 2006 (UTC)

[edit] alternative (simpler ?) linear 5-coloring algorithm

Hi Deco (?),

Maybe I have alternative algorithm for 5-coloring of simple planar graph, entirely different approach and probably simpler.

Actually, I designed that algoritm a few years ago but I prefered to examine its implication on 4-coloring (seems it has no such implication).

I think I had the source paper for your (modified ?) algorithm somewhere inmy computer backups but I cannot find it. Trying now to access this paper from on-line ACM ( ?) magazine I'm asked for a password or something like this (which I have not). Can you pass me the file of that source paper ?

Before presenting my algorithm (and carefully re-check it), I would like to know wether this is the _only_ linear time algorithm (for 5-coloring of simple planar graph).

a212.150.100.44 212.150.100.44 19:25, 3 August 2007 (UTC)

This article (or talk page) would be an inappropriate place to present your algorithm due to our Wikipedia:No original research policy, but if you have found a simpler 5-coloring algorithm I definitely encourage you to get some people in the area to look at it for possible publication. I unfortunately can't send you a copy of the publication as this would subvert ACM's exclusive distribution rights, but you might try contacting one of the original authors. Dcoetzee 02:54, 4 August 2007 (UTC)