David
Created page with " ==Trees== {{main | Wikipedia:Tree (graph theory)}} For an unconnected graph G, the following are equivalent * G is connected and acyclic (contains no cycles). * G is acyclic,..."
17:58
+456