Discrete Mathematics & Theoretical Computer Science
| author: | Hans L. Bodlaender |
|---|---|
| title: | A note on domino treewidth |
| keywords: | Treewidth, Domino treewidth, Graph algorithms, Tree decompositions |
| abstract: | In [DO95], Ding and Oporowski proved that for every k, and d,
there exists a constant ck,d, such that every graph with treewidth
at most k and maximum degree at most d has domino treewidth at
most ck,d. This note gives a new simple proof of this fact, with a
better bound for ck,d, namely (9k+7)d(d+1) -1.
It is also shown that a lower bound of Ω(kd) holds: there are
graphs with domino treewidth at least 1/12 × kd-1, treewidth at
most k, and maximum degree at most d, for many values k
and d.
The domino treewidth of a tree is at most its maximum degree.
If your browser does not display the abstract correctly (because of the different mathematical symbols) you can look it up in the PostScript or PDF files. |
| reference: | Hans L. Bodlaender (1999), A note on domino treewidth, Discrete Mathematics and Theoretical Computer Science 3, pp. 141-150 |
| bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
| ps.gz-source: | dm030401.ps.gz (45 K) |
| ps-source: | dm030401.ps (131 K) |
| pdf-source: | dm030401.pdf (94 K) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.