{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:34:33Z","timestamp":1787322873163,"version":"build-2736575974"},"reference-count":36,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","funder":[{"name":"Ontario Ministry of Research and Innovation"},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002910","name":"F\u00c3\u00a9d\u00c3\u00a9ration Wallonie-Bruxelles","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002910","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1618301"],"award-info":[{"award-number":["CCF-1618301"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1616248"],"award-info":[{"award-number":["CCF-1616248"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2020,1]]},"abstract":"<jats:p>We prove that a minor-closed class of graphs has bounded layered pathwidth if and only if some apex-forest is not in the class. This generalizes a theorem of Robertson and Seymour, which says that a minor-closed class of graphs has bounded pathwidth if and only if some forest is not in the class.<\/jats:p>","DOI":"10.1137\/18m122162x","type":"journal-article","created":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T14:53:57Z","timestamp":1596120837000},"page":"1693-1709","source":"Crossref","is-referenced-by-count":5,"title":["Minor-Closed Graph Classes with Bounded Layered Pathwidth"],"prefix":"10.1137","volume":"34","author":[{"given":"Vida","family":"Dujmovi\u0107","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7157-6694","authenticated-orcid":true,"given":"Gwena\u00ebl","family":"Joret","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8866-3041","authenticated-orcid":true,"given":"David R.","family":"Wood","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2020,7,30]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0487-5"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(91)90068-U"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793251219"},{"key":"atypb4","doi-asserted-by":"crossref","unstructured":"H. L. Bodlaender and T. Kloks,\n                      Better algorithms for the pathwidth and treewidth of graphs\n                      , in Proceedings of the 18th International Colloquium on Automata, Languages and Programming, J. Leach Albert, B. Monien, and M. Rodr\u00edguez-Artalejo, eds., Lecture Notes in Comput. Sci. 510, Springer, New York, 1991, pp. 544-555,https:\/\/doi.org\/10.1007\/3-540-54233-7_162.","DOI":"10.1007\/3-540-54233-7_162"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00190-5"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1145\/2820609"},{"key":"atypb7","first-page":"645","author":"Chuzhoy J.","year":"2015","journal-title":"ACM"},{"key":"atypb8","first-page":"1445","author":"Chuzhoy J.","year":"2019","journal-title":"ACM"},{"key":"atypb9","unstructured":"T. N. Dang,\n                      Minors of Graphs of Large Path-Width\n                      , Ph.D. thesis, Georgia Institute of Technology, 2018.http:\/\/aco.gatech.edu\/sites\/default\/files\/documents\/dang-thesis.pdf."},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480103433410"},{"key":"atypb11","first-page":"840","author":"Demaine E. D.","year":"2004","journal-title":"SIAM"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01961541"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794280736"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1998.1862"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1137\/16M1062879"},{"key":"atypb16","doi-asserted-by":"crossref","unstructured":"V. Dujmovi\u0107, L. Esperet, P. Morin, B. Walczak, and D. R. Wood,\n                      Clustered 3-Colouring Graphs of Bounded Degree\n                      ,https:\/\/arxiv.org\/abs\/2002.11721, 2020.","DOI":"10.1017\/S0963548321000213"},{"key":"atypb17","first-page":"862","author":"Dujmovi\u0107 V.","year":"2019","journal-title":"IEEE"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702416141"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2017.05.006"},{"key":"atypb20","unstructured":"V. Dujmovi\u0107, P. Morin, and C. Yelle,\n                      Two results on Layered Pathwidth and Linear Layouts\n                      ,https:\/\/arxiv.org\/abs\/2004.03571, 2020."},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010020"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548314000170"},{"key":"atypb23","doi-asserted-by":"crossref","unstructured":"J. Flum and M. Grohe,\n                      Parameterized Complexity Theory\n                      , Texts Theoret. Comput. Sci. EATCS Ser., Springer, New York, 2006,https:\/\/doi.org\/10.1007\/3-540-29953-X.","DOI":"10.1007\/3-540-29953-X"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-003-0037-9"},{"key":"atypb25","first-page":"77","author":"Gutwenger C.","year":"2000","journal-title":"New York"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1137\/0202012"},{"key":"atypb27","unstructured":"T. Kloks,\n                      Treewidth\n                      , Ph.D. thesis, Utrecht University, Utrecht, The Netherlands, 1993."},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.08.043"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2014.09.003"},{"key":"atypb30","unstructured":"C.H. Liu and D. R. Wood,\n                      Clustered Coloring of Graphs Excluding a Subgraph\n                      ,https:\/\/arxiv.org\/abs\/1905.08969, 2019."},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-37-00336-3"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548315000073"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90079-5"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90030-4"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(03)00042-X"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1994.1073"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/18M122162X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:30:43Z","timestamp":1787319043000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/18M122162X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["10.1137\/18M122162X"],"URL":"https:\/\/doi.org\/10.1137\/18m122162x","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}