Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 1995-1999  (2)
Material
Years
Year
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Graphs and combinatorics 15 (1999), S. 29-77 
    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
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Graphs and combinatorics 15 (1999), S. 211-220 
    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
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...