Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-00958932
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, March 13, 2014 - 4:47:55 PM
Last modification on : Tuesday, August 13, 2019 - 10:16:02 AM
Long-term archiving on: : Friday, June 13, 2014 - 12:00:47 PM

File

dm030401.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00958932, version 1

Collections

Citation

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

Share

Metrics

Record views

103

Files downloads

997