Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

Diameter and Treewidth in Minor-Closed Graph Families

  • 262 Accesses

  • 138 Citations


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.

Author information

Additional information

Received January 28, 1997; revised December 10, 1997.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Eppstein, D. Diameter and Treewidth in Minor-Closed Graph Families . Algorithmica 27, 275–291 (2000).

Download citation

  • Key words. Local treewidth, Excluded minors, Apex graphs, k -Outerplanar graphs, Approximation algorithms, Subgraph isomorphism.