1 paper
L. Sunil Chandran, Naveen Sivadasan
In this paper, we relate the seemingly unrelated concepts of treewidth and boxicity. Our main result is that, for any graph G, boxicity(G) <= treewidth(G) + 2. We also show that th…