Alecu, B. orcid.org/0000-0002-5515-9145, Lozin, V.V., Quiroz, D.A. orcid.org/0000-0002-2479-0508 et al. (3 more authors) (2024) The Treewidth and Pathwidth of Graph Unions. SIAM Journal on Discrete Mathematics, 38 (1). pp. 261-276. ISSN 0895-4801
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 + 3l + 1 containing both G1 and G2 as subgraphs.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2024 Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev. Reproduced in accordance with the publisher's self-archiving policy. |
Keywords: | treewidth; pathwidth; graph union; gluing of graphs |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Algorithms & Complexity |
Depositing User: | Symplectic Publications |
Date Deposited: | 25 Apr 2024 12:09 |
Last Modified: | 25 Apr 2024 12:09 |
Status: | Published |
Publisher: | Society for Industrial & Applied Mathematics |
Identification Number: | 10.1137/22m1524047 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:211811 |