A note on domino treewidth
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, na...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
1999-12-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/103 |