Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:category |
Eulerian path problem
historical mathematics problem unsolved problem (before Euler) |
| gptkbp:dateOfSolution |
1736
|
| gptkbp:Euler'sSolution |
No, it is not possible
|
| gptkbp:hasGraphRepresentation |
multigraph
|
| gptkbp:hasNumberOfBridges |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
The Bridges of Konigsberg
|
| gptkbp:involves |
gptkb:Pregel_River
two islands two riverbanks |
| gptkbp:locatedIn |
gptkb:Königsberg
|
| gptkbp:publishedIn |
gptkb:Solutio_problematis_ad_geometriam_situs_pertinentis
|
| gptkbp:relatedTo |
graph theory
|
| gptkbp:significance |
origin of graph theory
origin of topology |
| gptkbp:solvedBy |
gptkb:Leonhard_Euler
|
| gptkbp:type |
Is it possible to walk through the city crossing each bridge exactly once?
|
| gptkbp:bfsParent |
gptkb:singingbanana
|
| gptkbp:bfsLayer |
8
|