Abstract.
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received January 28, 1997; revised December 10, 1997.
Rights and permissions
About this article
Cite this article
Eppstein, D. Diameter and Treewidth in Minor-Closed Graph Families . Algorithmica 27, 275–291 (2000). https://doi.org/10.1007/s004530010020
Issue Date:
DOI: https://doi.org/10.1007/s004530010020