1 problem

Let $G$ be a unicyclic graph and let $T$ be a spanning tree of $G$. The spanning-tree upper-bound conjecture. If $T$ is a spanning tree of a unicyclic graph $G$, then … This conjec…