Enumerating tuples of spanning trees

Rahul CS, Michal Wlodarczyk

Deciding whether a graph has k-edge-disjoint spanning trees is a well-studied problem. We consider the problem of enumerating all sets of spanning trees with polynomial delay. This…