The treewidth and pathwidth of graph unions

by   Bogdan Alecu, et al.

For two graphs G_1 and G_2 on the same vertex set [n]:={1,2, …, n}, and a permutation φ of [n], the union of G_1 and G_2 along φ is the graph which is the union of G_2 and the graph obtained from G_1 by renaming its vertices according to φ. We examine the behaviour of the treewidth and pathwidth of graphs under this "gluing" operation. We show that under certain conditions on G_1 and G_2, we may bound those parameters for such unions in terms of their values for the original graphs, regardless of what permutation φ we choose. In some cases, however, this is only achievable if φ is chosen carefully, while yet in others, it is always impossible to achieve boundedness. More specifically, among other results, we prove that if G_1 has treewidth k and G_2 has pathwidth ℓ, then they can be united into a graph of treewidth at most k + 3 ℓ + 1. On the other hand, we show that for any natural number c there exists a pair of trees G_1 and G_2 whose every union has treewidth more than c.


page 1

page 2

page 3

page 4


Clustered independence and bounded treewidth

A set S⊆ V of vertices of a graph G is a c-clustered set if it induces a...

Tangled Paths: A Random Graph Model from Mallows Permutations

We introduce the random graph 𝒫(n,q) which results from taking the union...

Recoloring graphs of treewidth 2

Two (proper) colorings of a graph are adjacent if they differ on exactly...

On Tuza's conjecture for triangulations and graphs with small treewidth

Tuza (1981) conjectured that the size τ(G) of a minimum set of edges tha...

Treewidth of display graphs: bounds, brambles and applications

Phylogenetic trees and networks are leaf-labelled graphs used to model e...

Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach

It can be shown that each permutation group G S_n can be embedded, in a...

On the treewidth of Hanoi graphs

The objective of the well-known Towers of Hanoi puzzle is to move a set ...

Please sign up or login with your details

Forgot password? Click here to reset