Talk:Five color theorem
From Wikipedia, the free encyclopedia
 |
|||||
| Mathematics grading: | B Class | Mid Importance | Field: Discrete mathematics | ||
| Really needs diagrams; needs a less technical overview. Tompw (talk) | |||||
[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)
