{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T09:05:49Z","timestamp":1775466349076,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Dujmovi\u0107, 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\".<\/jats:p>","DOI":"10.37236\/10614","type":"journal-article","created":{"date-parts":[[2022,6,16]],"date-time":"2022-06-16T18:32:31Z","timestamp":1655404351000},"source":"Crossref","is-referenced-by-count":16,"title":["An Improved Planar Graph Product Structure Theorem"],"prefix":"10.37236","volume":"29","author":[{"given":"Torsten","family":"Ueckerdt","sequence":"first","affiliation":[]},{"given":"David","family":"Wood","sequence":"additional","affiliation":[]},{"given":"Wendy","family":"Yi","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2022,6,17]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v29i2p51\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v29i2p51\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,16]],"date-time":"2022-06-16T18:32:31Z","timestamp":1655404351000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v29i2p51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,17]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2022,4,8]]}},"URL":"https:\/\/doi.org\/10.37236\/10614","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,17]]},"article-number":"P2.51"}}