Talk:Four color theorem: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Thomas Wright Sulcer
(did this)
 
imported>Thomas Wright Sulcer
(more)
Line 1: Line 1:
{{subpages}}
{{subpages}}
Created.--[[User:Thomas Wright Sulcer|Thomas Wright Sulcer]] 04:06, 19 April 2010 (UTC)
Created.--[[User:Thomas Wright Sulcer|Thomas Wright Sulcer]] 04:06, 19 April 2010 (UTC)
Needs more wikilinks by persons who know which mathematical articles we've got and what they're called. Could use more pictures of diagrams?--[[User:Thomas Wright Sulcer|Thomas Wright Sulcer]] 04:18, 19 April 2010 (UTC)

Revision as of 23:18, 18 April 2010

This article is developing and not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
To learn how to update the categories for this article, see here. To update categories, edit the metadata template.
 Definition (A famous mathematical statement with a long history) For every planar graph, four colors suffice to color its vertices in such a way that adjacent vertices have different colors. [d] [e]
Checklist and Archives
 Workgroup category Mathematics [Editors asked to check categories]
 Talk Archive none  English language variant American English

Created.--Thomas Wright Sulcer 04:06, 19 April 2010 (UTC)

Needs more wikilinks by persons who know which mathematical articles we've got and what they're called. Could use more pictures of diagrams?--Thomas Wright Sulcer 04:18, 19 April 2010 (UTC)