, Volume 40, Issue 3, pp 211-215
Date: 09 Aug 2004

Diameter and Treewidth in Minor-Closed Graph Families, Revisited

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Eppstein [5] characterized the minor-closed graph families for which the treewidth is bounded by a function of the diameter, which includes, e.g., planar graphs. This characterization has been used as the basis for several (approximation) algorithms on such graphs (e.g., [2] and [5]–[8]). The proof of Eppstein is complicated. In this short paper we obtain the same characterization with a simple proof. In addition, the relation between treewidth and diameter is slightly better and explicit.