Diameter and Treewidth in Minor-Closed Graph Families

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.

[1]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[2]  Xin He,et al.  NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems , 1995, WG.

[3]  Zhi-Zhong Chen,et al.  Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3, 3}-free or K_5-free Graphs , 1996, ICALP.

[4]  Norishige Chiba,et al.  Applications of the Lipton and Tarjan's Planar Separator Theorem , 1981 .

[5]  Robin Thomas,et al.  A survey of linkless embeddings , 1991, Graph Structure Theory.

[6]  Rajeev Motwani,et al.  Towards a syntactic characterization of PTAS , 1996, STOC '96.

[7]  Robin Thomas,et al.  Quickly Excluding a Planar Graph , 1994, J. Comb. Theory, Ser. B.

[8]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[9]  Zhi-Zhong Chen.  NC Algorithms for Partitioning Sparse Graphs into Induced Forests with an Application , 1995, ISAAC.

[10]  Nobuji Saito,et al.  Linear-time computability of combinatorial problems on series-parallel graphs , 1982, JACM.

[11]  Eugene L. Lawler,et al.  Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs , 1987, J. Algorithms.

[12]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[13]  Robin Thomas,et al.  A separator theorem for graphs with an excluded minor and its applications , 1990, STOC '90.

[14]  David Eppstein,et al.  The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems , 1994, GD.

[15]  Dominic Welsh,et al.  Knots and braids: Some algorithmic questions , 1991, Graph Structure Theory.

[16]  Harry B. Hunt,et al.  A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1994, ESA.

[17]  Dimitrios M. Thilikos,et al.  Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems , 1997, Inf. Process. Lett..

[18]  Josep Díaz Cort,et al.  Parallel approximation schemes for problems on planar graphs , 1993 .

[19]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[20]  David Eppstein,et al.  Connectivity, graph minors, and subgraph multiplicity , 1993, J. Graph Theory.

[21]  Hans L. Bodlaender,et al.  Some Classes of Graphs with Bounded Treewidth , 1988, Bull. EATCS.