Treewidth 2 in the Planar Graph Product Structure Theorem

We prove that every planar graph is contained in $H_1\boxtimes H_2\boxtimes K_2$ for some graphs $H_1$ and $H_2$ both with treewidth 2. This resolves a question of Liu, Norin and Wood [arXiv:2410.20333]. We also show this result is best possible: for any $c \in \mathbb{N}$, there is a planar graph $...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Mathematics and Theoretical Computer Science Vol. 27:2; no. Graph Theory; p. 1
Main Authors Distel, Marc, Hendrey, Kevin, Karol, Nikolai, Wood, David R., Yip, Jung Hon
Format Journal Article
LanguageEnglish
Published DMTCS 01.08.2025
Discrete Mathematics & Theoretical Computer Science
Subjects
computer science - discrete mathematics
Decomposition (Mathematics)
Graph theory
mathematics - combinatorics
Australia
Online AccessGet full text
ISSN1365-8050
1462-7264
1365-8050
DOI10.46298/dmtcs.14785

Cover

More Information
Summary:We prove that every planar graph is contained in $H_1\boxtimes H_2\boxtimes K_2$ for some graphs $H_1$ and $H_2$ both with treewidth 2. This resolves a question of Liu, Norin and Wood [arXiv:2410.20333]. We also show this result is best possible: for any $c \in \mathbb{N}$, there is a planar graph $G$ such that for any tree $T$ and graph $H$ with $\text{tw}(H) \leqslant 2$, $G$ is not contained in $H \boxtimes T \boxtimes K_c$. Comment: arXiv admin note: text overlap with arXiv:2410.20333
ISSN:1365-8050
1462-7264
1365-8050
DOI:10.46298/dmtcs.14785