A note on domino treewidthReport as inadecuate

A note on domino treewidth - Download this document for free, or read online. Document in PDF available to download.

1 Department of Computer Science Utrecht

Abstract : In DO95, Ding and Oporowski proved that for every k, and d, there exists a constant c k,d, such that every graph with treewidth at most k and maximum degree at most d has domino treewidth at most c k,d. This note gives a new simple proof of this fact, with a better bound for c k,d, namely 9k+7dd+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.

Keywords : Treewidth Domino treewidth Graph algorithms Tree decompositions

Author: Hans L. Bodlaender -

Source: https://hal.archives-ouvertes.fr/


Related documents