An improved planar graph product structure theorem

07/31/2021
by   Torsten Ueckerdt, et al.
0

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⊆ H⊠ P. We improve this result by replacing "treewidth at most 8" by "simple treewidth at most 6".

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset