Statements (53)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:theorem
|
| gptkbp:designedBy |
George_Kempe
|
| gptkbp:fieldOfInvention |
mathematicians.
|
| gptkbp:firstIntroduced |
1879
|
| gptkbp:hasClient |
topological graph theory
|
| gptkbp:hasDepartment |
counterexamples in specific cases
|
| gptkbp:hasExperienceIn |
certain classes of graphs
|
| gptkbp:hasHistoricalSignificance |
mathematics
|
| gptkbp:hasInfluenceOn |
subsequent research in graph theory
|
| gptkbp:hasInventor |
map coloring problems
|
| gptkbp:historicalPeriod |
mathematical conjectures
|
| https://www.w3.org/2000/01/rdf-schema#label |
Kempe's conjecture
|
| gptkbp:isActiveIn |
mathematical proofs
mathematical problem solving |
| gptkbp:isAssociatedWith |
combinatorial theory
graph algorithms discrete mathematics research in combinatorial optimization graph coloring theory |
| gptkbp:isATypeOf |
coloring conjecture
|
| gptkbp:isAvailableIn |
mathematics
graph theory mathematical education |
| gptkbp:isAvenueFor |
mathematicians
coloring algorithms coloring planar graphs |
| gptkbp:isChallengedBy |
true
|
| gptkbp:isConsidered |
combinatorial mathematics
theoretical studies mathematicians studying graph properties |
| gptkbp:isDiscussedIn |
online forums
mathematical conferences mathematical literature |
| gptkbp:isExaminedBy |
graph theory textbooks
|
| gptkbp:isExploredIn |
theoretical computer science
computer simulations algorithmic graph theory |
| gptkbp:isLocatedIn |
academic papers
|
| gptkbp:isNamedAfter |
George_Kempe
|
| gptkbp:isPartOf |
the study of planar graphs
the history of mathematics |
| gptkbp:isRelatedTo |
graph theory
coloring problems in computer science planar graph properties |
| gptkbp:isSetIn |
true
|
| gptkbp:issues |
graph coloring
|
| gptkbp:isTrainedIn |
empirical data
|
| gptkbp:isUtilizedFor |
students of mathematics
complexity of planar graphs |
| gptkbp:isUtilizedIn |
graph coloring algorithms
|
| gptkbp:keyIssues |
graph theory research
|
| gptkbp:relatedTo |
four color theorem
|
| gptkbp:state |
every planar graph can be colored with at most five colors without adjacent vertices sharing the same color.
|