Page "Tree (graph theory)" Paragraph 27
from
Wikipedia
* Every connected graph G admits a spanning tree, which is a tree that contains every vertex of G and whose edges are edges of G.
Page 1 of 1.
1.968 seconds.