{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T20:29:22Z","timestamp":1723235362645},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,7,24]],"date-time":"2021-07-24T00:00:00Z","timestamp":1627084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,24]],"date-time":"2021-07-24T00:00:00Z","timestamp":1627084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Soft Science Foundation of Henan Province","award":["192400410212"],"award-info":[{"award-number":["192400410212"]}]},{"name":"Science and Technology Key Project of Henan Province","award":["212102310464"],"award-info":[{"award-number":["212102310464"]}]},{"name":"Key Scientific Research Project of Higher Educational Insti- tutions of Henan Province","award":["21A110015"],"award-info":[{"award-number":["21A110015"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10878-021-00782-6","type":"journal-article","created":{"date-parts":[[2021,7,24]],"date-time":"2021-07-24T15:02:50Z","timestamp":1627138970000},"page":"384-401","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Decomposability of a class of k-cutwidth critical graphs"],"prefix":"10.1007","volume":"43","author":[{"given":"Zhen-Kun","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhong","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liu-Yong","family":"Pang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,24]]},"reference":[{"key":"782_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, New York"},{"key":"782_CR2","unstructured":"Chung FRK (1988) Labelings of graphs. In: Beineke LW, Wilson RJ (eds) Selected topics in graph theory 3:151\u2013168"},{"key":"782_CR3","first-page":"268","volume":"75","author":"FRK Chung","year":"1985","unstructured":"Chung FRK, Seymour PD (1985) Graphs with small bandwidth and cutwidth. Discrete Math. 75:268\u2013277","journal-title":"Discrete Math."},{"key":"782_CR4","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":"782_CR5","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":"782_CR6","volume-title":"Computers to and intractability: a guide the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers to and intractability: a guide the theory of NP-completeness. W.H. Freeman & Company, San Francisco"},{"key":"782_CR7","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. Discrete Appl Math 43:97\u2013101","journal-title":"Discrete Appl Math"},{"key":"782_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1051\/ita\/2012032","volume":"47","author":"L Lin","year":"2013","unstructured":"Lin L, Lin Y (2013) Cutwidth of iterated caterpillars. RAIRO-Theor Inf Appl 47:181\u2013193","journal-title":"RAIRO-Theor Inf Appl"},{"key":"782_CR9","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. Discrete Math 275:339\u2013346","journal-title":"Discrete Math"},{"key":"782_CR10","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/0606044","volume":"6","author":"F Makedon","year":"1985","unstructured":"Makedon F, Papadimitriou CH, Sudborough IH (1985) Topological bandwidth. SIAM J Algebraic Discrete Methods 6:418\u2013444","journal-title":"SIAM J Algebraic Discrete Methods"},{"issue":"1","key":"782_CR11","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":"782_CR12","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1051\/ita:2000128","volume":"34","author":"I Vrto","year":"2000","unstructured":"Vrto I (2000) Cutwidth of the r-dimensional mesh of d-ary trees. RAIRO Theor Inform Appl 34:515\u2013519","journal-title":"RAIRO Theor Inform Appl"},{"key":"782_CR13","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 arrangement of trees. J ACM 32:950\u2013989","journal-title":"J ACM"},{"key":"782_CR14","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/s40314-019-0924-3","volume":"38","author":"Z Zhang","year":"2019","unstructured":"Zhang Z (2019) Decompositions of critical trees with cutwidth $$k$$. Comput Appl Math 38:148","journal-title":"Comput Appl Math"},{"issue":"1","key":"782_CR15","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 Combin Optim 34(1):233\u2013244","journal-title":"J Combin Optim"},{"key":"782_CR16","first-page":"149","volume":"105","author":"Z Zhang","year":"2012","unstructured":"Zhang Z, Lin Y (2012) On 4-cutwidth critical trees. Ars Combinatoria 105:149\u2013160","journal-title":"Ars Combinatoria"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00782-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00782-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00782-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T18:32:13Z","timestamp":1646073133000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00782-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,24]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["782"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00782-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,24]]},"assertion":[{"value":"12 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}