{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:01Z","timestamp":1740107101382,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T00:00:00Z","timestamp":1620086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T00:00:00Z","timestamp":1620086400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["001"],"award-info":[{"award-number":["001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s00373-021-02319-4","type":"journal-article","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T19:33:05Z","timestamp":1620156785000},"page":"1311-1331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Partitioning a Graph into Complementary Subgraphs"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3002-5172","authenticated-orcid":false,"given":"Julliano R.","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":[[2021,5,4]]},"reference":[{"key":"2319_CR1","unstructured":"Booth, K.S., Colbourn, C.J.: Problems polynomially equivalent to graph isomorphism. Tech. Rep. CS-77-04, University of Waterloo (1979)"},{"key":"2319_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. Theor. Comput. Sci. 521, 1\u20137 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"2319_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 Comb. 79, 21\u201331 (2006)","journal-title":"Ars Comb."},{"issue":"2","key":"2319_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. Algebr Discret Methods 6(2), 268\u2013277 (1985)","journal-title":"SIAM J. Algebr Discret Methods"},{"issue":"2","key":"2319_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":"2319_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":"2319_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":"2319_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":"2319_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":"2319_CR10","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364","volume-title":"Graph theory","author":"F Harary","year":"1969","unstructured":"Harary, F.: Graph theory. Addison-Wesley, Reading (1969)"},{"key":"2319_CR11","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":"2319_CR12","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)"},{"key":"2319_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-030-39881-1_19","volume-title":"WALCOM: algorithms and computation","author":"JR Nascimento","year":"2020","unstructured":"Nascimento, J.R., Souza, U.S., Szwarcfiter, J.L.: Partitioning a graph into complementary subgraphs. In: Rahman, M.S., Sadakane, K., Sung, W.K. (eds.) WALCOM: algorithms and computation, pp. 223\u2013235. Springer International Publishing, Cham (2020)"},{"issue":"1\u20133","key":"2319_CR14","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. Discret. Appl. Math. 82(1\u20133), 209\u2013217 (1998)","journal-title":"Discret. Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02319-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02319-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02319-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T07:09:23Z","timestamp":1625036963000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02319-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,4]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["2319"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02319-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2021,5,4]]},"assertion":[{"value":"4 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}