SEARCH

SEARCH BY CITATION

Keywords:

  • treewidth;
  • cartesian product

Abstract

The following theorem is proved: for all k-connected graphs G and H each with at least n vertices, the treewidth of the cartesian product of G and H is at least inline image. For inline image, this lower bound is asymptotically tight for particular graphs G and H. This theorem generalizes a well-known result about the treewidth of planar grid graphs.