{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:35Z","timestamp":1740122435097,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,7,20]],"date-time":"2016-07-20T00:00:00Z","timestamp":1468972800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10878-016-0061-5","type":"journal-article","created":{"date-parts":[[2016,7,20]],"date-time":"2016-07-20T06:45:33Z","timestamp":1468997133000},"page":"233-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Characterizations of k-cutwidth critical trees"],"prefix":"10.1007","volume":"34","author":[{"given":"Zhen-Kun","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong-Jian","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"61_CR1","doi-asserted-by":"crossref","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":"61_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":"61_CR3","doi-asserted-by":"crossref","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":"61_CR4","doi-asserted-by":"crossref","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":"61_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":"61_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(93)90171-J","volume":"43","author":"E Korach","year":"1993","unstructured":"Korach E, Solel N (1993) Treewidth, pathwidth and cutwidth. Discret Appl Math 43:97\u2013101","journal-title":"Discret Appl Math"},{"key":"61_CR7","doi-asserted-by":"crossref","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":"2","key":"61_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s11766-002-0036-4","volume":"17","author":"Y Lin","year":"2002","unstructured":"Lin Y, Li X, Yang A (2002) A degree sequence method for the cutwidth problem of graphs. Appl Math J Chin Univ B 17(2):125\u2013134","journal-title":"Appl Math J Chin Univ B"},{"issue":"3","key":"61_CR9","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s11766-003-0062-x","volume":"18","author":"Y Lin","year":"2003","unstructured":"Lin Y (2003) The cutwidth of trees with diameter at most 4. Appl Math J Chin Univ B 18(3):361\u2013369","journal-title":"Appl Math J Chin Univ B"},{"issue":"3","key":"61_CR10","first-page":"339","volume":"10","author":"H Liu","year":"1995","unstructured":"Liu H, Yuan J (1995) Cutwidth problem on graphs. Appl Math J Chin Univ A 10(3):339\u2013348","journal-title":"Appl Math J Chin Univ A"},{"key":"61_CR11","unstructured":"Rolin J, Sykora O, Vrto I (1995) Optimal cutwidth of meshes., Lecture Notes in Computer Science. Springer, Berlin"},{"key":"61_CR12","doi-asserted-by":"crossref","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":"61_CR13","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"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0061-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0061-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0061-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0061-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,9]],"date-time":"2017-06-09T03:11:34Z","timestamp":1496977894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0061-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,20]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["61"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0061-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2016,7,20]]}}}