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⊆H⊠P. We improve this result by replacing "treewidth at most 8" by "simple treewidth at most 6".
@article{arxiv.2108.00198,
title = {An improved planar graph product structure theorem},
author = {Torsten Ueckerdt and David R. Wood and Wendy Yi},
journal= {arXiv preprint arXiv:2108.00198},
year = {2021}
}
Comments
arXiv admin note: text overlap with arXiv:1904.04791