Statements (5)
| Predicate | Object |
|---|---|
| gptkbp:defines |
traversing every edge of a graph exactly once and returning to the starting vertex
|
| https://www.w3.org/2000/01/rdf-schema#label |
Eulerian circuits
|
| gptkbp:bfsParent |
gptkb:Eulerian_paths
gptkb:Bridges_of_Konigsberg |
| gptkbp:bfsLayer |
5
|