Statements (10)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Franklin's theorem
|
| gptkbp:namedAfter |
gptkb:Philip_Franklin
|
| gptkbp:publishedIn |
gptkb:Transactions_of_the_American_Mathematical_Society
|
| gptkbp:relatedTo |
gptkb:five_color_theorem
|
| gptkbp:sentence |
Every planar graph can be colored with at most five colors so that no two adjacent vertices have the same color.
|
| gptkbp:yearProved |
1922
|
| gptkbp:bfsParent |
gptkb:Philip_A._S._Franklin
|
| gptkbp:bfsLayer |
6
|