LEMMA 2.2 Let T be a spanning tree of a graph G, and let e be an edge of G not in T. Then T +e contains a unique cycle. PROOF Let e = (u, v).
確定! 回上一頁