{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:18:48Z","timestamp":1725862728509},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319445427"},{"type":"electronic","value":"9783319445434"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44543-4_20","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T11:49:58Z","timestamp":1470656998000},"page":"253-265","source":"Crossref","is-referenced-by-count":1,"title":["Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes"],"prefix":"10.1007","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":[[2016,8,9]]},"reference":[{"issue":"3","key":"20_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":"20_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":"20_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_5$$ , gem)-free graphs. Discrete Appl. Math. 145(2), 155\u2013166 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"20_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":"20_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_5$$ , gem)-free graphs have bounded clique-width. Discrete Appl. Math. 145(2), 232\u2013241 (2005)","journal-title":"Discrete Appl. Math."},{"key":"20_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 Thorique et Appl. 26, 257\u2013286 (1992)","journal-title":"Informatique Thorique et Appl."},{"issue":"1\u20132","key":"20_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":"20_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 Comput. Syst. 33(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"issue":"1\u20133","key":"20_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. Discrete Appl. Math. 101(1\u20133), 77\u2013114 (2000)","journal-title":"Discrete Appl. Math."},{"key":"20_CR10","unstructured":"Dabrowski, K.K., Dross, F., Paulusma, D.: Colouring diamond-free graphs. In: Pagh, R. (ed.) SWAT 2016. LIPIcs, vol 53, pp. 16:1\u201316:14. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2016)"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Dabrowski, K.K., Huang, S., Paulusma, D.: Bounding clique-width via perfect graphs. J. Comput. Syst. Sci. (2016, in press). doi: 10.1016\/j.jcss.2016.06.007","DOI":"10.1016\/j.jcss.2016.06.007"},{"issue":"5","key":"20_CR12","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":"20_CR13","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":"20_CR14","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. J. Graph Theory 14(4), 427\u2013435 (1990)","journal-title":"J. Graph Theory"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/3-540-45477-2_12","volume-title":"Graph-Theoretic Concepts in Computer Science","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. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, pp. 117\u2013128. Springer, Heidelberg (2001)"},{"issue":"1\u20132","key":"20_CR16","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!. Theoret. Comput. Sci. 256(1\u20132), 63\u201392 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"20_CR17","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":"20_CR18","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. Discrete Appl. Math. 126(2\u20133), 197\u2013221 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"16","key":"20_CR19","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. Discrete Math. 311(16), 1813\u20131822 (2011)","journal-title":"Discrete Math."},{"issue":"3","key":"20_CR20","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. J. Comb. Theory Ser. A 13(3), 297\u2013305 (1972)","journal-title":"J. Comb. Theory Ser. A"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Lozin, V.V., Razgon, I., Zamaraev, V.: Well-quasi-ordering does not imply bounded clique-width. In: Proceedings of WG 2015. LNCS, vol. 9224 (2015, to appear)","DOI":"10.1007\/978-3-662-53174-7_25"},{"issue":"4","key":"20_CR22","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. J. Comb. Theory Ser. B 96(4), 514\u2013528 (2006)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1\u20133","key":"20_CR23","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. Theoret. Comput. Sci. 377(1\u20133), 260\u2013267 (2007)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"20_CR24","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.: Graph minors. IV. tree-width and well-quasi-ordering. J. Comb. Theory Ser. B 48(2), 227\u2013254 (1990)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"20_CR25","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.: 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","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44543-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T08:30:22Z","timestamp":1568277022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44543-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319445427","9783319445434"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44543-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}