Diameter and Treewidth in Minor-Closed Graph Families, Revisited
- First Online:
- Cite this article as:
- Demaine, E. & Hajiaghayi, M. Algorithmica (2004) 40: 211. doi:10.1007/s00453-004-1106-1
Eppstein  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.,  and –). 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.