ZIB

Treffer pro Seite

Treffer 1 - 1 | 1 Treffer

Alles auswählen Exportieren

Digitale Medien

Independent trees in graphs (1994)

Huck, Andreas

Springer

Graphs and combinatorics 10 (1994), S. 29-45

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 1435-5914

Quelle: Springer Online Journal Archives 1860-2000

Thema: Informatik , Mathematik

Notizen: 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.

Materialart: Digitale Medien

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

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

Treffer 1 - 1 | 1 Treffer