{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:43:11Z","timestamp":1740123791122,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,6,29]],"date-time":"2017-06-29T00:00:00Z","timestamp":1498694400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/K025090\/1"],"award-info":[{"award-number":["EP\/K025090\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/K025090\/1"],"award-info":[{"award-number":["EP\/K025090\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/L020408\/1"],"award-info":[{"award-number":["EP\/L020408\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"publisher","award":["RPG-2016-258"],"award-info":[{"award-number":["RPG-2016-258"]}],"id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"publisher","award":["RPG-2016-258"],"award-info":[{"award-number":["RPG-2016-258"]}],"id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s11083-017-9430-7","type":"journal-article","created":{"date-parts":[[2017,6,29]],"date-time":"2017-06-29T16:10:08Z","timestamp":1498752608000},"page":"253-274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes"],"prefix":"10.1007","volume":"35","author":[{"given":"Konrad K.","family":"Dabrowski","sequence":"first","affiliation":[]},{"given":"Vadim V.","family":"Lozin","sequence":"additional","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,29]]},"reference":[{"issue":"3","key":"9430_CR1","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s11083-014-9333-9","volume":"32","author":"A Atminas","year":"2015","unstructured":"Atminas, A., Lozin, V.V.: Labelled induced subgraphs and well-quasi-ordering. Order 32(3), 313\u2013328 (2015)","journal-title":"Order"},{"issue":"6","key":"9430_CR2","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9430_CR3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.dam.2004.01.009","volume":"145","author":"A Brandst\u00e4dt","year":"2005","unstructured":"Brandst\u00e4dt, A., Kratsch, D.: On the structure of (p\n                    5,gem)-free graphs. Discret. Appl. Math. 145(2), 155\u2013166 (2005)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"9430_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1142\/S0129054104002364","volume":"15","author":"A Brandst\u00e4dt","year":"2004","unstructured":"Brandst\u00e4dt, A., Le, H.-O., Mosca, R.: Gem- and co-gem-free graphs have bounded clique-width. Int. J. Found. Comput. Sci. 15(1), 163\u2013185 (2004)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"9430_CR5","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.dam.2004.01.014","volume":"145","author":"A Brandst\u00e4dt","year":"2005","unstructured":"Brandst\u00e4dt, A., Le, H.-O., Mosca, R.: Chordal co-gem-free and (p\n                    5,gem)-free graphs have bounded clique-width. Discret. Appl. Math. 145(2), 232\u2013241 (2005)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"9430_CR6","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1051\/ita\/1992260302571","volume":"26","author":"B Courcelle","year":"1992","unstructured":"Courcelle, B.: The monadic second-order logic of graphs III:, tree-decompositions, minor and complexity issues. Informatique Th\u00e9orique et Applications 26(3), 257\u2013286 (1992)","journal-title":"Informatique Th\u00e9orique et Applications"},{"issue":"1\u20132","key":"9430_CR7","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.ipl.2013.09.012","volume":"114","author":"B Courcelle","year":"2014","unstructured":"Courcelle, B.: Clique-width and edge contraction. Inf. Process. Lett. 114(1\u20132), 42\u201344 (2014)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9430_CR8","doi-asserted-by":"crossref","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 of Computing Systems 33(2), 125\u2013150 (2000)","journal-title":"Theory of Computing Systems"},{"issue":"1\u20133","key":"9430_CR9","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discret. Appl. Math. 101(1\u20133), 77\u2013114 (2000)","journal-title":"Discret. Appl. Math."},{"key":"9430_CR10","first-page":"16:1","volume":"53","author":"KK Dabrowski","year":"2016","unstructured":"Dabrowski, K.K., Dross, F., Paulusma, D.: Colouring diamond-free graphs. Proc. SWAT, 2016 LIPIcs 53, 16:1\u201316:14 (2016)","journal-title":"Proc. SWAT, 2016 LIPIcs"},{"key":"9430_CR11","doi-asserted-by":"crossref","unstructured":"Dabrowski, K.K., Huang, S., Paulusma, D.: Bounding clique-width via perfect graphs. Journal of Computer and System Sciences, (in press)","DOI":"10.1007\/978-3-319-15579-1_53"},{"key":"9430_CR12","first-page":"253","volume":"9843","author":"KK Dabrowski","year":"2016","unstructured":"Dabrowski, K.K., Lozin, V.V., Paulusma, D.: Well-quasi-ordering versus clique-width: New results on bigenic classes. Proc. IWOCA 2016, LNCS 9843, 253\u2013265 (2016)","journal-title":"Proc. IWOCA 2016, LNCS"},{"key":"9430_CR13","doi-asserted-by":"crossref","unstructured":"Dabrowski, K.K., Lozin, V.V., Paulusma, D.: Clique-Width and Well-Quasi Ordering of Triangle-Free Graph Classes. Proceedings WG 2017 LNCS, (to appear)","DOI":"10.1007\/978-3-319-68705-6_17"},{"issue":"5","key":"9430_CR14","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1093\/comjnl\/bxv096","volume":"59","author":"KK Dabrowski","year":"2016","unstructured":"Dabrowski, K.K., Paulusma, D.: Clique-width of graph classes defined by two forbidden induced subgraphs. Comput. J. 59(5), 650\u2013666 (2016)","journal-title":"Comput. J."},{"issue":"3","key":"9430_CR15","doi-asserted-by":"crossref","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":"9430_CR16","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1002\/jgt.3190140406","volume":"14","author":"P Damaschke","year":"1990","unstructured":"Damaschke, P.: Induced subgraphs and well-quasi-ordering. Journal of Graph Theory 14(4), 427\u2013435 (1990)","journal-title":"Journal of Graph Theory"},{"key":"9430_CR17","first-page":"117","volume":"2204","author":"W Espelage","year":"2001","unstructured":"Espelage, W., Gurski, F., Wanke, E.: How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. Proc. WG 2001, LNCS 2204, 117\u2013128 (2001)","journal-title":"Proc. WG 2001, LNCS"},{"issue":"1\u20132","key":"9430_CR18","doi-asserted-by":"crossref","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","key":"9430_CR19","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"s3\u20132","author":"G Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. s3\u20132(1), 326\u2013336 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"2\u20133","key":"9430_CR20","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(02)00198-1","volume":"126","author":"D Kobler","year":"2003","unstructured":"Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discret. Appl. Math. 126(2\u20133), 197\u2013221 (2003)","journal-title":"Discret. Appl. Math."},{"issue":"16","key":"9430_CR21","doi-asserted-by":"crossref","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. Discret. Math. 311(16), 1813\u20131822 (2011)","journal-title":"Discret. Math."},{"issue":"3","key":"9430_CR22","doi-asserted-by":"crossref","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. Journal of Combinatorial Theory Series A 13(3), 297\u2013305 (1972)","journal-title":"Journal of Combinatorial Theory Series A"},{"key":"9430_CR23","first-page":"351","volume":"9224","author":"VV Lozin","year":"2016","unstructured":"Lozin, V.V., Razgon, I., Zamaraev, V.: Well-quasi-ordering does not imply bounded clique-width. Proc. WG 2015, LNCS 9224, 351\u2013359 (2016)","journal-title":"Proc. WG 2015, LNCS"},{"issue":"4","key":"9430_CR24","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S-I Oum","year":"2006","unstructured":"Oum, S.-I., Seymour, P.D.: Approximating clique-width and branch-width. Journal of Combinatorial Theory Series B 96(4), 514\u2013528 (2006)","journal-title":"Journal of Combinatorial Theory Series B"},{"issue":"1\u20133","key":"9430_CR25","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.tcs.2007.03.043","volume":"377","author":"M Rao","year":"2007","unstructured":"Rao, M.: MSOL partitioning problems on graphs of bounded treewidth and clique-width. Theor. Comput. Sci. 377(1\u20133), 260\u2013267 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9430_CR26","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0095-8956(90)90120-O","volume":"48","author":"N Robertson","year":"1990","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. IV. Tree-width and well-quasi-ordering. Journal of Combinatorial Theory Series B 48(2), 227\u2013254 (1990)","journal-title":"Journal of Combinatorial Theory Series B"},{"issue":"2","key":"9430_CR27","doi-asserted-by":"crossref","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. Journal of Combinatorial Theory Series B 92(2), 325\u2013357 (2004)","journal-title":"Journal of Combinatorial Theory Series B"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-017-9430-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-017-9430-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-017-9430-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,25]],"date-time":"2018-06-25T05:27:51Z","timestamp":1529904471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-017-9430-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,29]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["9430"],"URL":"https:\/\/doi.org\/10.1007\/s11083-017-9430-7","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"type":"print","value":"0167-8094"},{"type":"electronic","value":"1572-9273"}],"subject":[],"published":{"date-parts":[[2017,6,29]]}}}