Product structure of graph classes with bounded treewidth

06/06/2022
by   Rutger Campbell, et al.
0

We show that many graphs with bounded treewidth can be described as subgraphs of the strong product of a graph with smaller treewidth and a bounded-size complete graph. To this end, define the "underlying treewidth" of a graph class 𝒢 to be the minimum non-negative integer c such that, for some function f, for every graph G ∈𝒢 there is a graph H with tw(H) ≤ c such that G is isomorphic to a subgraph of H ⊠ K_f(tw(G)). We introduce disjointed coverings of graphs and show they determine the underlying treewidth of any graph class. Using this result, we prove that the class of planar graphs has underlying treewidth 3; the class of K_s,t-minor-free graphs has underlying treewidth s (for t ≥max{s,3}); and the class of K_t-minor-free graphs has underlying treewidth t-2. In general, we prove that a monotone class has bounded underlying treewidth if and only if it excludes some fixed topological minor. We also study the underlying treewidth of graph classes defined by an excluded subgraph or excluded induced subgraph. We show that the class of graphs with no H subgraph has bounded underlying treewidth if and only if every component of H is a subdivided star, and that the class of graphs with no induced H subgraph has bounded underlying treewidth if and only if every component of H is a star.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/10/2020

Treewidth versus clique number in graph classes with a forbidden structure

Treewidth is an important graph invariant, relevant for both structural ...
research
12/21/2022

Edge separators for graphs excluding a minor

We prove that every n-vertex K_t-minor-free graph G of maximum degree Δ ...
research
08/22/2022

Product structure of graph classes with strongly sublinear separators

We investigate the product structure of hereditary graph classes admitti...
research
06/21/2019

The size Ramsey number of graphs with bounded treewidth

A graph G is Ramsey for a graph H if every 2-colouring of the edges of G...
research
11/08/2019

Treewidth-Pliability and PTAS for Max-CSPs

We identify a sufficient condition, treewidth-pliability, that gives a p...
research
01/24/2020

Notes on Graph Product Structure Theory

It was recently proved that every planar graph is a subgraph of the stro...
research
04/10/2023

Odd-Minors I: Excluding small parity breaks

Given an annotated graph class 𝒞, the 𝒞-blind-treewidth of a graph G is ...

Please sign up or login with your details

Forgot password? Click here to reset