Sciweavers

Share
COMBINATORICS
2006

The Absence of Efficient Dual Pairs of Spanning Trees in Planar Graphs

9 years 4 days ago
The Absence of Efficient Dual Pairs of Spanning Trees in Planar Graphs
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T in the dual graph G such that T and T do not intersect. We show that it is not always possible to find T in G such that the diameters of T and T are both within a uniform multiplicative constant (independent of G) of the diameters of their ambient graphs.
T. R. Riley, William P. Thurston
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where COMBINATORICS
Authors T. R. Riley, William P. Thurston
Comments (0)
books