Independent trees in planar graphs (Q1288514): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 11:42, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Independent trees in planar graphs |
scientific article |
Statements
Independent trees in planar graphs (English)
0 references
11 May 1999
0 references
Let \(x,y\) be two vertices in a simple, finite graph \(G\). Two paths from \(x\) to \(y\) are called openly disjoint if they only have \(x\) and \(y\) in common. The following theorem is proved. Let \(G\) be a simple finite, \(k\)-connected planar graph and let \(v\) be a vertex of \(G\). Then there exist \(k\) spanning trees \(T_1,\dots,T_k\) in \(G\) such that for each vertex \(x\neq v\), the \(k\) paths from \(x\) to \(v\) in \(T_1, \dots, T_k\) are pairwise openly disjoint.
0 references
\(k\)-connected planar graph
0 references
paths
0 references
openly disjoint
0 references
spanning trees
0 references