The absence of efficient dual pairs of spanning trees in planar graphs (Q2501002)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The absence of efficient dual pairs of spanning trees in planar graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The absence of efficient dual pairs of spanning trees in planar graphs |
scientific article |
Statements
The absence of efficient dual pairs of spanning trees in planar graphs (English)
0 references
30 August 2006
0 references
Summary: 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.
0 references
diameters
0 references
0.7511860728263855
0 references
0.7497617602348328
0 references
0.7452608346939087
0 references
