A note on domino treewidth - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 1999

A note on domino treewidth

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+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.
Fichier principal
Vignette du fichier
dm030401.pdf (132.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00958932 , version 1 (13-03-2014)

Identifiers

Cite

Hans L. Bodlaender. A note on domino treewidth. Discrete Mathematics and Theoretical Computer Science, 1999, Vol. 3 no. 4 (4), pp.141-150. ⟨10.46298/dmtcs.256⟩. ⟨hal-00958932⟩

Collections

TDS-MACS
32 View
780 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More