ISSN:
1435-5914
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract. We prove the following statement: Let G be a finite k-connected undirected planar graph and s be a vertex of G. Then there exist k spanning trees T 1,…,T k in G such that for each vertex x≠s of G, the k paths from x to s in T 1,…,T k are pairwise openly disjoint.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/s003730050030