Library

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Graphs and combinatorics 10 (1994), S. 29-45 
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract IfG is a finite undirected graph ands is a vertex ofG, then two spanning treesT 1 andT 2 inG are calleds — independent if for each vertexx inG the paths fromx tos inT 1 andT 2 are openly disjoint. It is known that the following statement is true fork≤3: IfG isk-connected, then there arek pairwises — independent spanning, trees inG. As a main result we show that this statement is also true fork=4 if we restrict ourselves to planar graphs. Moreover we consider similar statements for weaklys — independent spanning trees (i.e., the tree paths from a vertex tos are edge disjoint) and for directed graphs.
    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...