Diameter and Treewidth in Minor-Closed Graph Families

Details Diameter and Treewidth in Minor-Closed Graph Families Diameter and Treewidth in Minor-Closed Graph Families

1999-07-20

arxiv.org/abs/math/9907126v1

Algorithmica 27:275-291, 2000

Mathematics

Combinatorics

15 pages, 12 figures

Scientific paper

10.1007/s004530010020

It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show that treewidth is bounded by a function of the diameter in a minor-closed family, if and only if some apex graph does not belong to the family. In particular, the O(D) bound above can be extended to bounded-genus graphs. As a consequence, we extend several approximation algorithms and exact subgraph isomorphism algorithms from planar graphs to other graph families.

Affiliated with

Also associated with

No associations

Rating

Diameter and Treewidth in Minor-Closed Graph Families 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 Diameter and Treewidth in Minor-Closed Graph Families, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Diameter and Treewidth in Minor-Closed Graph Families will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-361295