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.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Received January 28, 1997; revised December 10, 1997.
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
- Key words. Local treewidth, Excluded minors, Apex graphs, k -Outerplanar graphs, Approximation algorithms, Subgraph isomorphism.