Abstract

This paper shows that K t K_t -minor-free (and K s , t K_{s, t} -minor-free) graphs G G are subgraphs of products of a tree-like graph H H (of bounded treewidth) and a complete graph K m K_m . Our results include optimal bounds on the treewidth of H H and optimal bounds (to within a constant factor) on m m in terms of the number of vertices of G G and the treewidth of G G . These results follow from a more general theorem whose corollaries include a strengthening of the celebrated separator theorem of Alon, Seymour, and Thomas [J. Amer. Math. Soc. 3 (1990), 801–808] and the Planar Graph Product Structure Theorem of Dujmović et al. [J. ACM 67 (2020)].

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.