2000 character limit reached
An improved planar graph product structure theorem
Published 31 Jul 2021 in math.CO and cs.DM | (2108.00198v1)
Abstract: Dujmovi\'c, 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\boxtimes P$. We improve this result by replacing "treewidth at most 8" by "simple treewidth at most 6".
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.