{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:59Z","timestamp":1759063619228,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531730"},{"type":"electronic","value":"9783662531747"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_25","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T10:50:06Z","timestamp":1470307806000},"page":"351-359","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Well-quasi-ordering Does Not Imply Bounded Clique-width"],"prefix":"10.1007","author":[{"given":"Vadim V.","family":"Lozin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Razgon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viktor","family":"Zamaraev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"key":"25_CR1","unstructured":"Atminas, A., Lozin, V.V., Razgon, I.: Well-quasi-ordering, tree-width and subquadratic properties of graphs. CoRR, abs\/1410.3260 (2014)"},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"25_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s11083-010-9174-0","volume":"27","author":"J Daligault","year":"2010","unstructured":"Daligault, J., Rao, M., Thomass\u00e9, S.: Well-quasi-order of relabel functions. Order 27(3), 301\u2013315 (2010)","journal-title":"Order"},{"issue":"4","key":"25_CR4","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1002\/jgt.3190140406","volume":"14","author":"P Damaschke","year":"1990","unstructured":"Damaschke, P.: Induced subgraphs and well-quasi-ordering. J. Graph Theor. 14(4), 427\u2013435 (1990)","journal-title":"J. Graph Theor."},{"key":"25_CR5","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer-Verlag, Heidelberg (2005)","edition":"3"},{"issue":"1\u20132","key":"25_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere!. Theor. Comput. Sci. 256(1\u20132), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"25_CR7","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2005.05.018","volume":"347","author":"F Gurski","year":"2005","unstructured":"Gurski, F., Wanke, E.: On the relationship between NLC-width and linear NLC-width. Theor. Comput. Sci. 347(1\u20132), 76\u201389 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 2, 326\u2013336 (1952)","journal-title":"Proc. London Math. Soc."},{"issue":"16","key":"25_CR9","doi-asserted-by":"publisher","first-page":"1813","DOI":"10.1016\/j.disc.2011.04.023","volume":"311","author":"N Korpelainen","year":"2011","unstructured":"Korpelainen, N., Lozin, V.V.: Two forbidden induced subgraphs and well-quasi-ordering. Discrete Math. 311(16), 1813\u20131822 (2011)","journal-title":"Discrete Math."},{"issue":"3","key":"25_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0097-3165(72)90063-5","volume":"13","author":"JB Kruskal","year":"1972","unstructured":"Kruskal, J.B.: The theory of well-quasi-ordering: a frequently discovered concept. J. Comb. Theory Ser. A 13(3), 297\u2013305 (1972)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"5","key":"25_CR11","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1016\/j.jctb.2007.04.001","volume":"97","author":"VV Lozin","year":"2007","unstructured":"Lozin, V.V., Rautenbach, D.: The relative clique-width of a graph. J. Comb. Theory Ser. B 97(5), 846\u2013858 (2007)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1\u20133","key":"25_CR12","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0012-365X(01)00094-2","volume":"244","author":"M Petkovsek","year":"2002","unstructured":"Petkovsek, M.: Letter graphs and well-quasi-order by induced subgraphs. Discrete Math. 244(1\u20133), 375\u2013388 (2002)","journal-title":"Discrete Math."},{"issue":"2","key":"25_CR13","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.D.: Graph minors XX. Wagner\u2019s conjecture. J. Comb. Theory Ser. B 92(2), 325\u2013357 (2004)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53174-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:12:01Z","timestamp":1558314721000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Garching","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2015","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2015","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2015","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2015","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}