{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T20:28:09Z","timestamp":1723235289378},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,9,30]],"date-time":"2019-09-30T00:00:00Z","timestamp":1569801600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,30]],"date-time":"2019-09-30T00:00:00Z","timestamp":1569801600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Supported by China Scholarship Council"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s40314-019-0924-3","type":"journal-article","created":{"date-parts":[[2019,9,30]],"date-time":"2019-09-30T23:21:15Z","timestamp":1569885675000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Decompositions of critical trees with cutwidth k"],"prefix":"10.1007","volume":"38","author":[{"given":"Zhen-Kun","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,30]]},"reference":[{"key":"924_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph theory. Springer, NewYork"},{"key":"924_CR2","first-page":"268","volume":"75","author":"FRK Chung","year":"1985","unstructured":"Chung FRK, Seymour PD (1985) Graphs with small bandwidth and cutwidth. Discret Math 75:268\u2013277","journal-title":"Discret Math"},{"key":"924_CR3","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/0214013","volume":"14","author":"MJ Chung","year":"1985","unstructured":"Chung MJ, Makedon F, Sudborough IH, Turner J (1985) Polynomial time algorithms for the min cut problem on degree restricted trees. SIAM J Comput 14:158\u2013177","journal-title":"SIAM J Comput"},{"key":"924_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J Diaz","year":"2002","unstructured":"Diaz J, Petit J, Serna M (2002) A survey of graph layout problems. ACM Comput Surv 34:313\u2013356","journal-title":"ACM Comput Surv"},{"key":"924_CR5","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman & Company, San Francisco"},{"key":"924_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0166-218X(93)90171-J","volume":"43","author":"E Korach","year":"1993","unstructured":"Korach E, Solel N (1993) Tree-width, path-width and cutwidth. Discret Appl Math 43:97\u2013101","journal-title":"Discret Appl Math"},{"key":"924_CR7","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.disc.2003.06.012","volume":"275","author":"Y Lin","year":"2004","unstructured":"Lin Y, Yang A (2004) On 3-cutwidth critical graphs. Discret Math 275:339\u2013346","journal-title":"Discret Math"},{"issue":"1","key":"924_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.jalgor.2004.12.003","volume":"56","author":"DM Thilikos","year":"2005","unstructured":"Thilikos DM, Serna M, Bodlaender HL (2005) Cutwidth II: algorithms for partial w-trees of bounded degree. J Algorithms 56(1):25\u201349","journal-title":"J Algorithms"},{"key":"924_CR9","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1145\/4221.4228","volume":"32","author":"M Yannakakis","year":"1985","unstructured":"Yannakakis M (1985) A polynomial algorithm for the min-cut linear arrangement of trees. J ACM 32:950\u2013988","journal-title":"J ACM"},{"key":"924_CR10","first-page":"149","volume":"105","author":"Z Zhang","year":"2012","unstructured":"Zhang Z, Lin Y (2012) On 4-cutwidth critical trees. Ars Comb 105:149\u2013160","journal-title":"Ars Comb"},{"key":"924_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10878-016-0061-5","volume":"34","author":"Z Zhang","year":"2017","unstructured":"Zhang Z, Lai H (2017) Characterizations of k-cutwidth critical trees. J Comb Optim 34:233\u2013244","journal-title":"J Comb Optim"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-019-0924-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s40314-019-0924-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-019-0924-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T23:27:32Z","timestamp":1601335652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s40314-019-0924-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,30]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["924"],"URL":"https:\/\/doi.org\/10.1007\/s40314-019-0924-3","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,30]]},"assertion":[{"value":"11 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"148"}}