{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:42:47Z","timestamp":1742913767711,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030398804"},{"type":"electronic","value":"9783030398811"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-39881-1_19","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T03:02:33Z","timestamp":1580094153000},"page":"223-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Partitioning a Graph into Complementary Subgraphs"],"prefix":"10.1007","author":[{"given":"Julliano Rosa","family":"Nascimento","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U\u00e9verton S.","family":"Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayme L.","family":"Szwarcfiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"key":"19_CR1","unstructured":"Booth, K.S., Colbourn, C.J.: Problems polynomially equivalent to graph isomorphism. Technical report CS-77-04, University of Waterloo (1979)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2013.11.006","volume":"521","author":"MR Cappelle","year":"2014","unstructured":"Cappelle, M.R., Penso, L., Rautenbach, D.: Recognizing some complementary products. Theoret. Comput. Sci. 521, 1\u20137 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR3","first-page":"21","volume":"79","author":"MR Cerioli","year":"2006","unstructured":"Cerioli, M.R., Szwarcfiter, J.L.: Characterizing intersection graphs af substars of a star. Ars Combinatoria 79, 21\u201331 (2006)","journal-title":"Ars Combinatoria"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1137\/0606026","volume":"6","author":"FRK Chung","year":"1985","unstructured":"Chung, F.R.K.: On the cutwidth and the topological bandwidth of a tree. SIAM J. Algebraic Discrete Methods 6(2), 268\u2013277 (1985)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1002\/jgt.21755","volume":"76","author":"R Churchley","year":"2014","unstructured":"Churchley, R., Huang, J.: On the polarity and monopolarity of graphs. J. Graph Theory 76(2), 138\u2013148 (2014)","journal-title":"J. Graph Theory"},{"key":"19_CR6","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, 13\u201321 (1981)","journal-title":"Networks"},{"issue":"4","key":"19_CR7","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"DG Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14(4), 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Feder, T., Hell, P., Klein, S., Motwani, R.: Complexity of graph partition problems. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp. 464\u2013472. ACM (1999)","DOI":"10.1145\/301250.301373"},{"key":"19_CR9","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, vol. 57. Elsevier, Amsterdam (2004)"},{"key":"19_CR10","first-page":"21","volume":"51","author":"TW Haynes","year":"2007","unstructured":"Haynes, T.W., Henning, M.A., Slater, P.J., van der Merwe, L.C.: The complementary product of two graphs. Bull. Inst. Comb. Appl. 51, 21\u201330 (2007)","journal-title":"Bull. Inst. Comb. Appl."},{"key":"19_CR11","volume-title":"Threshold Graphs and Related Topics","author":"NVR Mahadev","year":"1995","unstructured":"Mahadev, N.V.R., Peled, U.N.: Threshold Graphs and Related Topics, vol. 56. Elsevier, Amsterdam (1995)"},{"issue":"1\u20133","key":"19_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0166-218X(97)00128-5","volume":"82","author":"ZC Ortiz","year":"1998","unstructured":"Ortiz, Z.C., Maculan, N., Szwarcfiter, J.L.: Characterizing and edge-colouring split-indifference graphs. Discrete Appl. Math. 82(1\u20133), 209\u2013217 (1998)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39881-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:05:52Z","timestamp":1582139152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.comp.nus.edu.sg\/~walcom20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}