Back to Search
Start Over
THE TREEWIDTH AND PATHWIDTH OF GRAPH UNIONS.
- Source :
-
SIAM Journal on Discrete Mathematics . 2024, Vol. 38 Issue 1, p261-276. 16p. - Publication Year :
- 2024
-
Abstract
- Given two n-vertex graphs G1 and G2 of bounded treewidth, is there an n-vertex graph G of bounded treewidth having subgraphs isomorphic to G1 and G2? Our main result is a negative answer to this question, in a strong sense: we show that the answer is no even if G1 is a binary tree and G2 is a ternary tree. We also provide an extensive study of cases where such "gluing"" is possible. In particular, we prove that if G1 has treewidth k and G2 has pathwidth \l, then there is an n-vertex graph of treewidth at most k + 3\l + 1 containing both G1 and G2 as subgraphs. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 08954801
- Volume :
- 38
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- SIAM Journal on Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 177075446
- Full Text :
- https://doi.org/10.1137/22M1524047