{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T20:44:43Z","timestamp":1725914683037},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687049"},{"type":"electronic","value":"9783319687056"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-68705-6_17","type":"book-chapter","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T02:06:22Z","timestamp":1509501982000},"page":"220-233","source":"Crossref","is-referenced-by-count":3,"title":["Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph 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":[[2017,11,2]]},"reference":[{"issue":"3","key":"17_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"},{"key":"17_CR2","unstructured":"Blanch\u00e9, A., Dabrowski, K.K., Johnson, M., Lozin, V.V., Paulusma, D., Zamaraev, V.: Clique-width for graph classes closed under complementation. In: Proceeding of MFCS 2017. LIPIcs, vol. 83, pp. 73:1\u201373:14 (2017)"},{"issue":"1\u20132","key":"17_CR3","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":"17_CR4","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":"17_CR5","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":"17_CR6","doi-asserted-by":"crossref","unstructured":"Dabrowski, K.K., Dross, F., Paulusma, D.: Colouring diamond-free graphs. J. Comput. Syst. Sci. (in press)","DOI":"10.1016\/j.jcss.2017.06.005"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Dabrowski, K.K., Lozin, V.V., Paulusma, D.: Well-quasi-ordering versus clique-width: New results on bigenic classes. Order (in press)","DOI":"10.1007\/978-3-319-44543-4_20"},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.dam.2015.06.030","volume":"200","author":"KK Dabrowski","year":"2016","unstructured":"Dabrowski, K.K., Paulusma, D.: Classifying the clique-width of \n            $${H}$$\n            \n              \n                H\n              \n            \n          -free bipartite graphs. Discret. Appl. Math. 200, 43\u201351 (2016)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"17_CR9","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":"17_CR10","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":"17_CR11","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"},{"issue":"5","key":"17_CR12","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1002\/jgt.3190160509","volume":"16","author":"G Ding","year":"1992","unstructured":"Ding, G.: Subgraphs and well-quasi-ordering. J. Graph Theory 16(5), 489\u2013502 (1992)","journal-title":"J. Graph Theory"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). doi:\n10.1007\/3-540-45477-2_12"},{"issue":"1","key":"17_CR14","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. London Math. Soc. s3\u20132(1), 326\u2013336 (1952)","journal-title":"Proc. London Math. Soc."},{"issue":"12","key":"17_CR15","doi-asserted-by":"crossref","first-page":"2747","DOI":"10.1016\/j.dam.2008.08.022","volume":"157","author":"M Kami\u0144ski","year":"2009","unstructured":"Kami\u0144ski, M., Lozin, V.V., Milani\u010d, M.: Recent developments on graphs of bounded clique-width. Discret. Appl. Math. 157(12), 2747\u20132761 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"2\u20133","key":"17_CR16","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":"3","key":"17_CR17","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1002\/jgt.20528","volume":"67","author":"N Korpelainen","year":"2011","unstructured":"Korpelainen, N., Lozin, V.V.: Bipartite induced subgraphs and well-quasi-ordering. J. Graph Theory 67(3), 235\u2013249 (2011)","journal-title":"J. Graph Theory"},{"issue":"16","key":"17_CR18","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":"1","key":"17_CR19","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/S0895480102419755","volume":"18","author":"VV Lozin","year":"2004","unstructured":"Lozin, V.V., Rautenbach, D.: On the band-, tree-, and clique-width of graphs with bounded vertex degree. SIAM J. Discret Math. 18(1), 195\u2013206 (2004)","journal-title":"SIAM J. Discret Math."},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-662-53174-7_25","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"VV Lozin","year":"2016","unstructured":"Lozin, V.V., Razgon, I., Zamaraev, V.: Well-quasi-ordering does not imply bounded clique-width. In: Mayr, E.W. (ed.) WG 2015. LNCS, vol. 9224, pp. 351\u2013359. Springer, Heidelberg (2016). doi:\n10.1007\/978-3-662-53174-7_25"},{"issue":"4","key":"17_CR21","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":"17_CR22","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."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68705-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T02:11:12Z","timestamp":1509502272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68705-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687049","9783319687056"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68705-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}