#### Filter Results:

#### Publication Year

2014

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

A set of spanning trees in a graph is said to be independent (ISTs for short) if all the trees are rooted at the same node $$r$$ r and for any other node $$v(\ne r)$$ v ( ≠ r ) , the paths from $$v$$ v to $$r$$ r in any two trees are node-disjoint except the two end nodes $$v$$ v and $$r$$ r . It was conjectured that for any $$n$$ n -connected graph there… (More)

- ‹
- 1
- ›