Category:Paths (Graph Theory)

This category contains results about paths in the context of Graph Theory.
Definitions specific to this category can be found in Definitions/Paths (Graph Theory).

Let $G$ be an undirected graph.

A path in $G$ is a trail in $G$ in which all vertices (except perhaps the first and last ones) are distinct.

A path between two vertices $u$ and $v$ is called a $u$-$v$ path.