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 $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
Authors
- Nikolai Karol
- David R. Wood (ORCID: https://orcid.org/0000-0001-8866-3041)
- Jason Yip (ORCID: https://orcid.org/0000-0001-9980-0670)
- Marc Distel (ORCID: https://orcid.org/0000-0003-0122-1430)
- Kevin Hendrey
Publication Details
- Journal
- Discrete Mathematics & Theoretical Computer Science
- Published
- 2025-03-17
- DOI
- https://doi.org/10.46298/dmtcs.14785
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00