Linked from

The 19 pages that link to Path (graph theory), each with the reason it gives.

• Graph theoryRelated: Paths formalize routes through a graph and underpin distance and reachability.

• Graph (discrete mathematics)Broader topic: Paths capture indirect relationships formed by chaining edges.

• Shortest path problemRelated: The optimization compares the total weights of these possible routes.

• Edge (graph theory)Related: A path is built from edges rather than being a single connection.

• Vertex (graph theory)Related: A vertex can serve as an intermediate point or endpoint along a path.

• Breadth-first searchRelated: Breadth-first search discovers paths by extending them one edge per layer.

• Dijkstra's algorithmRelated: The algorithm seeks paths whose total edge weight is minimal.

• Tree (graph theory)Related: Between every pair of vertices in a tree, exactly one path exists.

• Connected componentRelated: The existence of paths between every pair defines membership in one component.

• Connected graphRelated: A path is the route that must exist between every vertex pair.

• Graph minorRelated: Contractions shorten paths, while connected branch sets rely on paths.

• Transitive closureRelated: A pair belongs to the closure when a path connects its vertices.

• Menger's theoremRelated: The theorem counts paths joining its specified endpoints.

• Odd cycleRelated: Cycles build on paths by joining the final vertex back to the first.

• Hamiltonian cycleRelated: A Hamiltonian cycle is a path through every vertex with an added closing edge.

• Hamiltonian path problemBroader topic: A Hamiltonian path is a path whose sequence includes every vertex.

• MazeRelated: A solution to a maze is a path from its entrance to its exit.

• Directed networkRelated: Paths in a directed network must follow every edge's orientation.

• Fleischner's theoremRelated: Paths of length at most two supply the connections used by the square.