Category:Examples of Paths (Graph Theory)

From ProofWiki
Jump to navigation Jump to search

This category contains examples of paths in the context of 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.

This category currently contains no pages or media.