Paths
- All-Pairs Shortest Path
- Antipodal Graph
- Antipode
- Average Disorder Number
- Bellman-Ford Algorithm
- Dijkstra's Algorithm
- Disorder Number
- Euler Chain
- Eulerian Path
- External Path Length
- Floyd-Warshall Algorithm
- Geodetic Graph
- Graceful Pi-Way
- Graph Path
- H^*-Connected Graph
- Hamilton-Laceable Graph
- Hamiltonian Number
- Hamiltonian Path
- Hamiltonian Walk
- Internal Path Length
- Königsberg Bridge Problem
- Longest Path
- Path Covering Number
- Path Graph
- Path Length
- Path Polynomial
- Pathwidth
- Route
- s-Route
- Shortest Path
- Shortest Path Problem
- Snake
- Steiner's Segment Problem
- Tour
- Traceable Graph
- Trail
- Walk
- Zebra Graph