{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:39:59Z","timestamp":1767339599933,"version":"3.37.3"},"reference-count":58,"publisher":"Oxford University Press (OUP)","issue":"5","funder":[{"DOI":"10.13039\/501100000266","name":"EPSRC","doi-asserted-by":"crossref","award":["EP\/G043434\/1 and EP\/K025090\/1"],"award-info":[{"award-number":["EP\/G043434\/1 and EP\/K025090\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"name":"ANR","award":["TODO ANR-09-EMER-010"],"award-info":[{"award-number":["TODO ANR-09-EMER-010"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1093\/comjnl\/bxv096","type":"journal-article","created":{"date-parts":[[2015,11,6]],"date-time":"2015-11-06T01:08:17Z","timestamp":1446772097000},"page":"650-666","source":"Crossref","is-referenced-by-count":29,"title":["Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs"],"prefix":"10.1093","volume":"59","author":[{"given":"Konrad K.","family":"Dabrowski","sequence":"first","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2015,11,4]]},"reference":[{"key":"2016060203540677000_59.5.650.1","doi-asserted-by":"crossref","unstructured":"Dabrowski K.K. and Paulusma D. (2015) Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs. Proc. CIAC 2015, Paris, France, May 20\u201322, Lecture Notes in Computer Science 9079, pp. 167\u2013181. Springer, Berlin, Heidelberg.","DOI":"10.1007\/978-3-319-18173-8_12"},{"key":"2016060203540677000_59.5.650.2","unstructured":"Gurski F. (2007) Graph operations on clique-width bounded graphs. CoRR, abs\/cs\/0701185."},{"key":"2016060203540677000_59.5.650.3","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.08.022"},{"key":"2016060203540677000_59.5.650.4","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.03.020"},{"key":"2016060203540677000_59.5.650.5","doi-asserted-by":"crossref","unstructured":"Boliac R. and Lozin V.V. (2002) On the Clique-Width of Graphs in Hereditary Classes. Proc. ISAAC 2002, Vancouver, Canada, November 21\u201323, Lecture Notes in Computer Science 2518, pp. 44\u201354. Springer, Berlin, Heidelberg.","DOI":"10.1007\/3-540-36136-7_5"},{"key":"2016060203540677000_59.5.650.6","doi-asserted-by":"crossref","unstructured":"Bonomo F. , Grippo L.N. , Milani\u010d M. and Safe M.D. Graph classes with and without powers of bounded clique-width. Discrete Appl. Math., pp. 13 (in press, available online June 2015).","DOI":"10.1016\/j.dam.2015.06.010"},{"key":"2016060203540677000_59.5.650.7","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt A. , Dabrowski K.K. , Huang S. and Paulusma D. (2015) Bounding the Clique-Width of $H$ -free Chordal Graphs. Proc. MFCS 2015, Milan, Italy, August 24\u201328, Lecture Notes in Computer Science 9235, pp. 139\u2013150. Springer, Berlin, Heidelberg.","DOI":"10.1007\/978-3-662-48054-0_12"},{"key":"2016060203540677000_59.5.650.8","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt A. , Dabrowski K.K. , Huang S. and Paulusma D. Bounding the Clique-Width of $H$ -Free Split Graphs. Proc. EuroComb 2015, Bergen, Norway, August 31\u2013September 4, Electronic Notes in Discrete Mathematics, pp. 7. Elsevier, Amsterdam (to appear).","DOI":"10.1016\/j.endm.2015.06.069"},{"key":"2016060203540677000_59.5.650.9","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-005-1199-1"},{"key":"2016060203540677000_59.5.650.10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.46298\/dmtcs.372","article-title":"$P_6$ - and triangle-free graphs revisited: structure and bounded clique-width","volume":"8","author":"Brandst\u00e4dt","year":"2006","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"2016060203540677000_59.5.650.11","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.01.009"},{"key":"2016060203540677000_59.5.650.12","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054104002364"},{"key":"2016060203540677000_59.5.650.13","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.01.014"},{"key":"2016060203540677000_59.5.650.14","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00291-0"},{"key":"2016060203540677000_59.5.650.15","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00180-X"},{"key":"2016060203540677000_59.5.650.16","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.12.004"},{"key":"2016060203540677000_59.5.650.17","doi-asserted-by":"crossref","unstructured":"Dabrowski K.K. , Huang S. and Paulusma D. (2015) Bounding Clique-Width Via Perfect Graphs. Proc. LATA 2015, Paris, France, March 2\u20136, Lecture Notes in Computer Science 8977, pp. 676\u2013688. Springer, Berlin, Heidelberg. Full version: arXiv CoRR abs\/1406.6298.","DOI":"10.1007\/978-3-319-15579-1_53"},{"key":"2016060203540677000_59.5.650.18","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.12.012"},{"key":"2016060203540677000_59.5.650.19","doi-asserted-by":"crossref","unstructured":"Dabrowski K.K. and Paulusma D. Classifying the clique-width of $H$ -free bipartite graphs. Discrete Appl. Math. (in press, available online July 2015).","DOI":"10.1007\/978-3-319-08783-2_42"},{"key":"2016060203540677000_59.5.650.20","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054100000260"},{"key":"2016060203540677000_59.5.650.21","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102419755"},{"key":"2016060203540677000_59.5.650.22","first-page":"57","article-title":"The tree- and clique-width of bipartite graphs in special classes","volume":"34","author":"Lozin","year":"2006","journal-title":"Australas. J. Comb."},{"key":"2016060203540677000_59.5.650.23","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054108005772"},{"key":"2016060203540677000_59.5.650.24","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054199000241"},{"key":"2016060203540677000_59.5.650.25","doi-asserted-by":"publisher","DOI":"10.1007\/s002249910009"},{"key":"2016060203540677000_59.5.650.26","doi-asserted-by":"crossref","unstructured":"Espelage W. , Gurski F. and Wanke E. (2001) How to Solve NP-Hard Graph Problems on Clique-width Bounded Graphs in Polynomial Time. Proc. WG 2001, Boltenhagen, Germany, June 14\u201316, Lecture Notes in Computer Science 2204, pp. 117\u2013128. Springer, Berlin, Heidelberg.","DOI":"10.1007\/3-540-45477-2_12"},{"key":"2016060203540677000_59.5.650.27","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00198-1"},{"key":"2016060203540677000_59.5.650.28","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.03.043"},{"key":"2016060203540677000_59.5.650.29","doi-asserted-by":"publisher","DOI":"10.1137\/070687256"},{"key":"2016060203540677000_59.5.650.30","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/1435375.1435385","article-title":"Approximating rank-width and clique-width quickly","volume":"5","author":"Oum","year":"2008","journal-title":"ACM Trans. Algorithms"},{"key":"2016060203540677000_59.5.650.31","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2005.10.006"},{"key":"2016060203540677000_59.5.650.32","unstructured":"Stein W.A. et al. (2013) Sage Mathematics Software (Version 5.9). http:\/\/www.sagemath.org."},{"key":"2016060203540677000_59.5.650.33","unstructured":"de Ridder H.N. et al. (2001\u20132013) Information system on graph classes and their inclusions. http:\/\/www.graphclasses.org (accessed October 2015)."},{"key":"2016060203540677000_59.5.650.34","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.10.010"},{"key":"2016060203540677000_59.5.650.35","doi-asserted-by":"crossref","unstructured":"Kr\u00e1l' D. , Kratochv\u00edl J. , Tuza Z. and Woeginger G.J. (2001) Complexity of Coloring Graphs Without Forbidden Induced Subgraphs. Proc. WG 2001, Boltenhagen, Germany, June 14\u201316, Lecture Notes in Computer Science 2204, pp. 254\u2013262. Springer, Berlin, Heidelberg.","DOI":"10.1007\/3-540-45477-2_23"},{"key":"2016060203540677000_59.5.650.36","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-014-0733-y"},{"key":"2016060203540677000_59.5.650.37","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.03.003"},{"key":"2016060203540677000_59.5.650.38","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxv039"},{"key":"2016060203540677000_59.5.650.39","doi-asserted-by":"crossref","unstructured":"Kratsch S. and Schweitzer P. (2012) Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs. Proc. WG 2012, Jerusalem, Israel, June 26\u201328, Lecture Notes in Computer Science 7551, pp. 34\u201345. Springer, Berlin, Heidelberg.","DOI":"10.1007\/978-3-642-34611-8_7"},{"key":"2016060203540677000_59.5.650.40","unstructured":"Schweitzer P. (2015) Towards an Isomorphism Dichotomy for Hereditary Graph Classes. Proc. STACS 2015, Munich, Germany, March 4\u20137, Leibniz International Proceedings in Informatics 30, pp. 689\u2013702. Schloss Dagstuhl \u2013 Leibniz Center for Informatics, Wadern, Germany."},{"key":"2016060203540677000_59.5.650.41","doi-asserted-by":"crossref","unstructured":"Grohe M. and Schweitzer P. Isomorphism Testing for Graphs of Bounded Rank Width. Proc. FOCS 2015, Berkeley, CA, October 18\u201320, pp. 10. IEEE Computer Society, Los Alamitos, CA (to appear).","DOI":"10.1109\/FOCS.2015.66"},{"key":"2016060203540677000_59.5.650.42","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(81)90013-5"},{"key":"2016060203540677000_59.5.650.43","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.03.018"},{"key":"2016060203540677000_59.5.650.44","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701385351"},{"key":"2016060203540677000_59.5.650.45","first-page":"39","article-title":"Clique-decomposition, NLC-decomposition, and modular decomposition - relationships and results for random graphs","volume":"132","author":"Johansson","year":"1998","journal-title":"Congressus Numerantium"},{"key":"2016060203540677000_59.5.650.46","unstructured":"Diestel R. (2012) Graph Theory (4th edn). Graduate Texts in Mathematics 173. Springer, Berlin, Heidelberg."},{"key":"2016060203540677000_59.5.650.47","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","article-title":"On a problem of formal logic","volume":"s2-30","author":"Ramsey","year":"1930","journal-title":"Proc. London Math. Soc."},{"key":"2016060203540677000_59.5.650.48","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00184-5"},{"key":"2016060203540677000_59.5.650.49","doi-asserted-by":"crossref","unstructured":"Gurski F. and Wanke E. (2000) The Tree-Width of Clique-width Bounded Graphs without $K_{n,n}$ . Proc. WG 2000, Konstanz, Germany, June 15\u201317, Lecture Notes in Computer Science 1928, pp. 196\u2013205. Springer, Berlin, Heidelberg.","DOI":"10.1007\/3-540-40064-8_19"},{"key":"2016060203540677000_59.5.650.50","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2013.09.012"},{"key":"2016060203540677000_59.5.650.51","doi-asserted-by":"crossref","unstructured":"Chuzhoy J. (2015) Improved Bounds for the Flat Wall Theorem. Proc. SODA 2015, San Diego, CA, January 4\u20136, pp. 256\u2013275. SIAM, Philadelphiai, PA.","DOI":"10.1137\/1.9781611973730.20"},{"key":"2016060203540677000_59.5.650.52","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90143-3"},{"key":"2016060203540677000_59.5.650.53","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90030-4"},{"key":"2016060203540677000_59.5.650.54","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.12.076"},{"key":"2016060203540677000_59.5.650.55","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.10.005"},{"key":"2016060203540677000_59.5.650.56","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(03)00312-1"},{"key":"2016060203540677000_59.5.650.57","first-page":"3","article-title":"A note on Brooks' theorem for triangle-free graphs","volume":"26","author":"Randerath","year":"2002","journal-title":"Australas. J. Comb."},{"key":"2016060203540677000_59.5.650.58","unstructured":"Golovach P.A. , Johnson M. , Paulusma D. and Song J. (2014) A survey on the computational complexity of colouring graphs with forbidden subgraphs. CoRR, abs\/1407.1482."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/59\/5\/650\/7903020\/bxv096.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T11:51:00Z","timestamp":1653479460000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxv096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,4]]},"references-count":58,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2016,5,10]]},"published-print":{"date-parts":[[2016,5]]}},"alternative-id":["10.1093\/comjnl\/bxv096"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxv096","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published":{"date-parts":[[2015,11,4]]}}}