Abstract
We prove that for every graph with vertices, the treewidth of plus the treewidth of the complement of is at least . This bound is tight.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.