{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:56:54Z","timestamp":1725796614419},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_42","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T10:04:30Z","timestamp":1404554670000},"page":"489-500","source":"Crossref","is-referenced-by-count":4,"title":["Classifying the Clique-Width of H-Free Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Konrad Kazimierz","family":"Dabrowski","sequence":"first","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-36136-7_5","volume-title":"Algorithms and Computation","author":"R. Boliac","year":"2002","unstructured":"Boliac, R., Lozin, V.: On the clique-width of graphs in hereditary classes. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 44\u201354. Springer, Heidelberg (2002)"},{"key":"42_CR2","unstructured":"Bonomo, F., Grippo, L.N., Milani\u010d, M., Safe, M.D.: Graphs of power-bounded clique-width. arXiv, abs\/1402.2135 (2014)"},{"issue":"4","key":"42_CR3","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s00224-005-1199-1","volume":"39","author":"A. Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Engelfriet, J., Le, H.-O., Lozin, V.: Clique-width for 4-vertex forbidden subgraphs. Theory of Computing Systems\u00a039(4), 561\u2013590 (2006)","journal-title":"Theory of Computing Systems"},{"issue":"1","key":"42_CR4","first-page":"173","volume":"8","author":"A. Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Klembt, T., Mahfud, S.: P 6- and triangle-free graphs revisited: structure and bounded clique-width. Discrete Mathematics and Theoretical Computer Science\u00a08(1), 173\u2013188 (2006)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"issue":"2","key":"42_CR5","doi-asserted-by":"publisher","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 Applied Mathematics\u00a0145(2), 155\u2013166 (2005)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"42_CR6","doi-asserted-by":"publisher","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. International Journal of Foundations of Computer Science\u00a015(1), 163\u2013185 (2004)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"2","key":"42_CR7","doi-asserted-by":"publisher","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 Applied Mathematics\u00a0145(2), 232\u2013241 (2005)","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"42_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(02)00291-0","volume":"84","author":"A. Brandst\u00e4dt","year":"2002","unstructured":"Brandst\u00e4dt, A., Mahfud, S.: Maximum weight stable set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. Information Processing Letters\u00a084(5), 251\u2013259 (2002)","journal-title":"Information Processing Letters"},{"issue":"2-3","key":"42_CR9","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/S0166-218X(03)00180-X","volume":"129","author":"A. Brandst\u00e4dt","year":"2003","unstructured":"Brandst\u00e4dt, A., Mosca, R.: On variations of P 4-sparse graphs. Discrete Applied Mathematics\u00a0129(2-3), 521\u2013532 (2003)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"42_CR10","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 of Computing Systems\u00a033(2), 125\u2013150 (2000)","journal-title":"Theory of Computing Systems"},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2013.12.004","volume":"522","author":"K.K. Dabrowski","year":"2013","unstructured":"Dabrowski, K.K., Golovach, P.A., Paulusma, D.: Colouring of graphs with Ramsey-type forbidden subgraphs. Theoretical Computer Science\u00a0522, 34\u201343 (2013)","journal-title":"Theoretical Computer Science"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Dabrowski, K.K., Paulusma, D.: Clique-width of graph classes defined by two forbidden induced subgraphs. coRR, abs\/1405.7092 (2014)","DOI":"10.1007\/978-3-319-18173-8_12"},{"key":"42_CR13","unstructured":"Gurski, F.: Graph operations on clique-width bounded graphs. CoRR, abs\/cs\/0701185 (2007)"},{"issue":"12","key":"42_CR14","doi-asserted-by":"publisher","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., Milani\u010d, M.: Recent developments on graphs of bounded clique-width. Discrete Applied Mathematics\u00a0157(12), 2747\u20132761 (2009)","journal-title":"Discrete Applied Mathematics"},{"issue":"2-3","key":"42_CR15","doi-asserted-by":"publisher","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 Applied Mathematics\u00a0126(2-3), 197\u2013221 (2003)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"42_CR16","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/S0895480102419755","volume":"18","author":"V. Lozin","year":"2004","unstructured":"Lozin, V., Rautenbach, D.: On the band-, tree-, and clique-width of graphs with bounded vertex degree. SIAM Journal on Discrete Mathematics\u00a018(1), 195\u2013206 (2004)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"42_CR17","first-page":"57","volume":"34","author":"V. Lozin","year":"2006","unstructured":"Lozin, V., Rautenbach, D.: The tree- and clique-width of bipartite graphs in special classes. Australasian Journal of Combinatorics\u00a034, 57\u201367 (2006)","journal-title":"Australasian Journal of Combinatorics"},{"issue":"02","key":"42_CR18","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1142\/S0129054108005772","volume":"19","author":"V. Lozin","year":"2008","unstructured":"Lozin, V., Volz, J.: The clique-width of bipartite graphs in monogenic classes. International Journal of Foundations of Computer Science\u00a019(02), 477\u2013494 (2008)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"3","key":"42_CR19","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1142\/S0129054199000241","volume":"10","author":"J. Makowsky","year":"1999","unstructured":"Makowsky, J., Rotics, U.: On the clique-width of graphs with few P 4\u2019s. International Journal of Foundations of Computer Science\u00a010(3), 329\u2013348 (1999)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"42_CR20","doi-asserted-by":"crossref","unstructured":"Oum, S.-I.: Approximating rank-width and clique-width quickly. ACM Trans. Algorithms\u00a05(1), 10:1\u201310:20 (2008)","DOI":"10.1145\/1435375.1435385"},{"issue":"1-3","key":"42_CR21","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0377(1-3), 260\u2013267 (2007)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T08:54:16Z","timestamp":1565600056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}