The treewidth and pathwidth of graph unions

Bogdan Alecu, Vadim Lozin, Daniel A. Quiroz +3

Given two $n$-vertex graphs $G_1$ and $G_2$ of bounded treewidth, is there an $n$-vertex graph $G$ of bounded treewidth having subgraphs isomorphic to $G_1$ and $G_2$? Our main res…