Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
planar graphs
planar maps |
| gptkbp:category |
coloring theorem
|
| gptkbp:field |
gptkb:topology
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
five color theorem
|
| gptkbp:provenBy |
gptkb:Percy_John_Heawood
mathematical induction |
| gptkbp:publishedIn |
gptkb:Quarterly_Journal_of_Pure_and_Applied_Mathematics
|
| gptkbp:relatedTo |
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:significance |
Weaker than the four color theorem
|
| gptkbp:yearProved |
1890
|
| gptkbp:bfsParent |
gptkb:Franklin's_theorem
gptkb:Four_color_theorem |
| gptkbp:bfsLayer |
7
|