ZIB

Hits per page

hit 1 - 1 | 1 hit

Select All Export

Electronic Resource

Independent Trees and Branchings in Planar Multigraphs (1999)

Huck, Andreas

Springer

Graphs and combinatorics 15 (1999), S. 211-220

add to mindlist on the mindlist

Details

ISSN: 1435-5914

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science , Mathematics

Notes: Abstract. The following statement is proved: Let G be a finite directed or undirected planar multigraph and s be a vertex of G such that for each vertex x≠s of G, there are at least k pairwise openly disjoint paths in G from x to s where k∉{3,4,5} if G is directed. Then there exist k spanning trees T 1, … ,T k in G directed towards s if G is directed 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. – The case where G is directed and k∈{3,4,5} remains open.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/s003730050041

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit