BibTeX
CSL-JSON
MLA
Harvard
Treewidth of Cartesian Products of Highly Connected Graphs
release_367pzl6dfvdf3ephg4d3raiuda
by
David R. Wood
Released
as a article
.
2011
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 k(n -2k+2)-1. For n≫ k this lower bound is
asymptotically tight for particular graphs G and H. This theorem
generalises a well known result about the treewidth of planar grid graphs.
In text/plain
format
Archived Files and Locations
application/pdf 78.3 kB
file_aw7eavkfcfgyxkbdhzqgqus4zi
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1105.1586v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links