Category:Definitions/Paths (Graph Theory)
Jump to navigation
Jump to search
This category contains definitions related to paths in the context of Graph Theory.
Related results can be found in Category: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.
Subcategories
This category has the following 2 subcategories, out of 2 total.
C
P
Pages in category "Definitions/Paths (Graph Theory)"
The following 19 pages are in this category, out of 19 total.