An improved planar graph product structure theorem

Abstract

Dujmović, Joret, Micek, Morin, Ueckerdt and Wood [J. ACM 2020] proved that for every planar graph $G$ there is a graph $H$ with treewidth at most 8 and a path $P$ such that $G\subseteq H⊠P$. We improve this result by replacing "treewidth at most 8" by "simple treewidth at most 6".

arXiv admin note: text overlap with arXiv:1904.04791