Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
historical problem |
| gptkbp:category |
gptkb:topology
discrete mathematics recreational mathematics |
| gptkbp:concerns |
gptkb:city_of_Königsberg
seven bridges |
| gptkbp:countryOfPublication |
gptkb:Latin
|
| gptkbp:formedBy |
gptkb:Leonhard_Euler
1736 |
| https://www.w3.org/2000/01/rdf-schema#label |
Königsberg bridges problem
|
| gptkbp:inspiredBy |
the development of graph theory
|
| gptkbp:location |
gptkb:Königsberg,_Prussia
|
| gptkbp:modernLocation |
gptkb:Kaliningrad,_Russia
|
| gptkbp:publishedIn |
gptkb:Solutio_problematis_ad_geometriam_situs_pertinentis
|
| gptkbp:relatedTo |
gptkb:Eulerian_circuit
gptkb:Eulerian_path |
| gptkbp:solvedBy |
graph theory
no such walk is possible |
| gptkbp:type |
whether it is possible to walk through the city crossing each bridge exactly once
|
| gptkbp:bfsParent |
gptkb:former_Königsberg
gptkb:Königsberg,_East_Prussia,_Weimar_Republic |
| gptkbp:bfsLayer |
6
|