Science Fair Project Encyclopedia
Heawood conjecture
The Heawood conjecture is a formula which gives the bound for the number of colors which are sufficient for graph coloring on a surface of a given genus.
External Links
- Heawood Conjecture On MathWorld
Last updated: 10-23-2005 20:46:00
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details


