A note on domino treewidth
1999 ◽
Vol Vol. 3 no. 4
◽
International audience 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.
2009 ◽
Vol Vol. 11 no. 2
(Graph and Algorithms)
◽
Keyword(s):
2008 ◽
Vol DMTCS Proceedings vol. AI,...
(Proceedings)
◽
Keyword(s):
2006 ◽
Vol DMTCS Proceedings vol. AG,...
(Proceedings)
◽
2012 ◽
Vol DMTCS Proceedings vol. AQ,...
(Proceedings)
◽
2000 ◽
Vol 23
(8)
◽
pp. 563-566
◽
Keyword(s):
2017 ◽
Vol 38
(8)
◽
pp. 3012-3041
◽
2018 ◽
Vol 10
(05)
◽
pp. 1850069
Keyword(s):
2017 ◽
Vol 17
(03n04)
◽
pp. 1741003
2017 ◽
Vol 96
(1)
◽
pp. 1-13
◽