Graph Algorithms:

3. A Unicycle Problem sts in an undirected graph if and only if a BPS of that graph has a cross-edge. (**) Your proof may use the following facts from graph theory There exists a unique path between any two vertices of a tree. . Adding any edge to a tree creates a unique cycle. 3. A Unicycle Problem sts in an undirected graph if and only if a BPS of that graph has a cross-edge. (**) Your proof may use the following facts from graph theory There exists a unique path between any two vertices of a tree. . Adding any edge to a tree creates a unique cycle