Four color theorem/Related Articles: Difference between revisions
Jump to navigation
Jump to search
imported>Thomas Wright Sulcer (did it) |
imported>Boris Tsirelson (→Parent topics: planar graph) |
||
| (2 intermediate revisions by one other user not shown) | |||
| Line 2: | Line 2: | ||
==Parent topics== | ==Parent topics== | ||
{{r| | |||
{{r| | {{r|Graph theory}} | ||
{{r|Graph coloring}} | |||
{{r|Planar graph}} | |||
{{r|Map coloring}} | |||
==Subtopics== | ==Subtopics== | ||
{{r|Critical graph}} | |||
{{r|Kempe chain}} | |||
==Other related topics== | ==Other related topics== | ||
{{r| | |||
{{r| | {{r|Chromatic number}} | ||
{{r|Computer proof}} | |||
Latest revision as of 11:34, 19 April 2010
- See also changes related to Four color theorem, or pages that link to Four color theorem or to this page or whose text contains "Four color theorem".
Parent topics
- Graph theory [r]: Field of mathematics studying graphs, which consist of nodes and arcs joining the nodes. [e]
- Graph coloring [r]: Graph labelling, which assigns labels traditionally called 'colours' to elements of a graph subject to certain constraints. [e]
- Planar graph [r]: Add brief definition or description
- Map coloring [r]: Add brief definition or description
Subtopics
- Critical graph [r]: Add brief definition or description
- Kempe chain [r]: Add brief definition or description