Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
planar graphs
planar maps |
| gptkbp:field |
gptkb:topology
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Five Color Theorem
|
| gptkbp:namedAfter |
number of colors required
|
| gptkbp:provenBy |
gptkb:Percy_John_Heawood
mathematical induction |
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_London_Mathematical_Society
|
| gptkbp:relatedTo |
gptkb:Four_Color_Theorem
|
| gptkbp:sentence |
Every planar map can be colored with at most five colors so that no two adjacent regions share the same color.
|
| gptkbp:yearProved |
1890
|
| gptkbp:bfsParent |
gptkb:Four_Color_Theorem
|
| gptkbp:bfsLayer |
8
|