Talk:Five color theorem

message: 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)
replies: text: When the full proof is only a couple sentences more than the "outline", who cares?  --C S (talk) 05:11, 10 March 2009 (UTC)
thread_title: Full proofs

message: 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)
replies: text: 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)
thread_title:  Linear-time algorithm 

message: 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)
replies: text: 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)
thread_title:  alternative (simpler ?) linear 5-coloring algorithm 

message: This is commonly taught in intro discrete courses (at least from my experience), almost always with the same distinct picture of a node and its 4 neighbours, and the various linkage possibilities between its neighbours. It makes the proof extremely clear, and if the page featured it it'd be even more accessible to people who are introduced to the theorem for the first time. So just a thought: maybe add a picture. Otherwise, when I'm not busy I might make one later. 142.157.58.177 (talk) 02:24, 2 March 2011 (UTC)
thread_title:  A picture would help 

message: At a certain point in the proof, we stop mentioning the 5th colour.  What difference does it make?  Why does the proof need colour #5?  --Doradus (talk) 00:49, 1 October 2012 (UTC)
replies: text: The proof depends on the fact that every planar graph has at least one vertex with only five neighbors. The corresponding statement with "four" instead of "five" is not true — it's possible to construct a planar graph where each vertex has five neighbors — so a hypothetical corresponding four-color proof would not work.  I've now rewritten the relevant paragraph in a way that hopefully makes it more clear what's going on there.  —RuakhTALK 17:25, 2 June 2013 (UTC)
thread_title:  Why doesn't the 5-colour proof work for 4 colours? 

message: Substituted at 02:06, 5 May 2016 (UTC)
thread_title: Assessment comment