The absence of efficient dual pairs of spanning trees in planar graphs

Details The absence of efficient dual pairs of spanning trees in planar graphs The absence of efficient dual pairs of spanning trees in planar graphs

2005-11-20

arxiv.org/abs/math/0511493v2

Electronic Journal of Computation, 13, N13, 2006

Mathematics

Combinatorics

7 pages, 3 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The absence of efficient dual pairs of spanning trees in planar graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The absence of efficient dual pairs of spanning trees in planar graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The absence of efficient dual pairs of spanning trees in planar graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-369575