Editing Spanning tree (section)

===Enumeration===
Because a graph may have exponentially many spanning trees, it is not possible to list them all in [[polynomial time]]. However, algorithms are known for listing all spanning trees in polynomial time per tree.<ref>{{citation
 | last1 = Gabow | first1 = Harold N. | author1-link = Harold N. Gabow
 | last2 = Myers | first2 = Eugene W. | author2-link = Eugene Myers
 | doi = 10.1137/0207024
 | issue = 3
 | journal = [[SIAM Journal on Computing]]
 | mr = 0495152
 | pages = 280–287
 | title = Finding all spanning trees of directed and undirected graphs
 | volume = 7
 | year = 1978}}</ref>