{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:19:04Z","timestamp":1742937544915,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030247652"},{"type":"electronic","value":"9783030247669"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24766-9_14","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T23:09:48Z","timestamp":1564528188000},"page":"181-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graph Isomorphism for $$(H_1,H_2)$$-Free Graphs: An Almost Complete Dichotomy"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7905-8018","authenticated-orcid":false,"given":"Marthe","family":"Bonamy","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9515-6945","authenticated-orcid":false,"given":"Konrad K.","family":"Dabrowski","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7295-2663","authenticated-orcid":false,"given":"Matthew","family":"Johnson","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5945-9287","authenticated-orcid":false,"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time [extended abstract]. In: Proceedings of STOC 2016, pp. 684\u2013697 (2016)","DOI":"10.1145\/2897518.2897542"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s00453-016-0234-8","volume":"80","author":"R Belmonte","year":"2018","unstructured":"Belmonte, R., Otachi, Y., Schweitzer, P.: Induced minor free graphs: isomorphism and clique-width. Algorithmica 80(1), 29\u201347 (2018)","journal-title":"Algorithmica"},{"key":"14_CR3","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: Proceedings of MFCS 2017. LIPIcs, vol. 83, pp. 73:1\u201373:14 (2017)"},{"key":"14_CR4","unstructured":"Booth, K.S., Colbourn, C.J.: Problems polynomially equivalent to graph isomorphism. Technical report CS-77-04, Department of Computer Science, University of Waterloo (1979)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.dam.2016.04.003","volume":"211","author":"A Brandst\u00e4dt","year":"2016","unstructured":"Brandst\u00e4dt, A., Dabrowski, K.K., Huang, S., Paulusma, D.: Bounding the clique-width of $$H$$-free split graphs. Discrete Appl. Math. 211, 30\u201339 (2016)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1002\/jgt.22111","volume":"86","author":"A Brandst\u00e4dt","year":"2017","unstructured":"Brandst\u00e4dt, A., Dabrowski, K.K., Huang, S., Paulusma, D.: Bounding the clique-width of $$H$$-free chordal graphs. J. Graph Theory 86(1), 42\u201377 (2017)","journal-title":"J. Graph Theory"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1002\/net.3230110103","volume":"11","author":"CJ Colbourn","year":"1981","unstructured":"Colbourn, C.J.: On testing isomorphism of permutation graphs. Networks 11(1), 13\u201321 (1981)","journal-title":"Networks"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/j.jcss.2017.06.005","volume":"89","author":"KK Dabrowski","year":"2017","unstructured":"Dabrowski, K.K., Dross, F., Paulusma, D.: Colouring diamond-free graphs. J. Comput. Syst. Sci. 89, 410\u2013431 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.jcss.2016.06.007","volume":"104","author":"Konrad K. Dabrowski","year":"2019","unstructured":"Dabrowski, K.K., Huang, S., Paulusma, D.: Bounding clique-width via perfect graphs. J. Comput. Syst. Sci. 104, 202\u2013215","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Dabrowski, K.K., Johnson, M., Paulusma, D.: Clique-width for hereditary graph classes. In: Proceedings of BCC 2019. London Mathematical Society Lecture Note Series, vol. 456, 1\u201356 (2019)","DOI":"10.1017\/9781108649094.002"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-319-68705-6_17","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"KK Dabrowski","year":"2017","unstructured":"Dabrowski, K.K., Lozin, V.V., Paulusma, D.: Clique-width and well-quasi-ordering of triangle-free graph classes. In: Bodlaender, H.L., Woeginger, G.J. (eds.) WG 2017. LNCS, vol. 10520, pp. 220\u2013233. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68705-6_17"},{"issue":"5","key":"14_CR12","doi-asserted-by":"publisher","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."},{"key":"14_CR13","unstructured":"Grohe, M., Neuen, D., Schweitzer, P., Wiebking, D.: An improved isomorphism test for bounded-tree-width graphs. In: Proceedings of ICALP 2018. LIPIcs, vol. 107, pp. 67:1\u201367:14 (2018)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Grohe, M., Schweitzer, P.: Isomorphism testing for graphs of bounded rank width. In: Proceedings of FOCS 2015, pp. 1010\u20131029 (2015)","DOI":"10.1109\/FOCS.2015.66"},{"issue":"12","key":"14_CR15","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.V., Milani\u010d, M.: Recent developments on graphs of bounded clique-width. Discrete Appl. Math. 157(12), 2747\u20132761 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"Part 1","key":"14_CR16","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.dam.2014.10.026","volume":"216","author":"S Kratsch","year":"2017","unstructured":"Kratsch, S., Schweitzer, P.: Graph isomorphism for graph classes characterized by two forbidden induced subgraphs. Discrete Appl. Math. 216(Part 1), 240\u2013253 (2017)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1137\/140999980","volume":"46","author":"D Lokshtanov","year":"2017","unstructured":"Lokshtanov, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. SIAM J. Comput. 46(1), 161\u2013189 (2017)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"14_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0012-365X(01)00471-X","volume":"257","author":"VV Lozin","year":"2002","unstructured":"Lozin, V.V.: Bipartite graphs without a skew star. Discrete Math. 257(1), 83\u2013100 (2002)","journal-title":"Discrete Math."},{"issue":"1","key":"14_CR19","doi-asserted-by":"publisher","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. Discrete Math. 18(1), 195\u2013206 (2004)","journal-title":"SIAM J. Discrete Math."},{"key":"14_CR20","unstructured":"Neuen, D.: Graph isomorphism for unit square graphs. In: Proceedings of ESA 2016. LIPIcs, vol. 57, pp. 70:1\u201370:17 (2016)"},{"issue":"1","key":"14_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(88)90143-3","volume":"28","author":"S Olariu","year":"1988","unstructured":"Olariu, S.: Paw-free graphs. Inf. Process. Lett. 28(1), 53\u201354 (1988)","journal-title":"Inf. Process. Lett."},{"key":"14_CR22","first-page":"147","volume":"174","author":"IN Ponomarenko","year":"1988","unstructured":"Ponomarenko, I.N.: Isomorphism problem for classes of graphs closed under contractions. Zapiski Nauchnykh Seminarov (LOMI) 174, 147\u2013177 (1988). (in Russian, English translation in Journal of Soviet Mathematics, 55(2), 1621\u20131643, (1991))","journal-title":"Zapiski Nauchnykh Seminarov (LOMI)"},{"key":"14_CR23","unstructured":"de Ridder, H.N., et al.: Information system on graph classes and their inclusions (2001\u20132019). http:\/\/www.graphclasses.org"},{"issue":"3","key":"14_CR24","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/0022-0000(88)90010-4","volume":"37","author":"U Sch\u00f6ning","year":"1988","unstructured":"Sch\u00f6ning, U.: Graph isomorphism is in the low hierarchy. J. Comput. Syst. Sci. 37(3), 312\u2013323 (1988)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"14_CR25","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1007\/s00224-017-9775-8","volume":"61","author":"P Schweitzer","year":"2017","unstructured":"Schweitzer, P.: Towards an isomorphism dichotomy for hereditary graph classes. Theory Comput. Syst. 61(4), 1084\u20131127 (2017)","journal-title":"Theory Comput. Syst."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24766-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:53:49Z","timestamp":1710266029000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24766-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030247652","9783030247669"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24766-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}