{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:26:57Z","timestamp":1742923617509,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066771"},{"type":"electronic","value":"9783031066788"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06678-8_19","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"257-269","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Perfect Matching Cuts Partitioning a\u00a0Graph into\u00a0Complementary Subgraphs"],"prefix":"10.1007","author":[{"given":"Diane","family":"Castonguay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erika M. M.","family":"Coelho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hebert","family":"Coelho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julliano\u00a0R.","family":"Nascimento","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U\u00e9verton S.","family":"Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R., et al.: Graph Theory with Applications, vol. 290. Macmillan, London (1976)"},{"issue":"21","key":"19_CR2","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1016\/j.ipl.2012.07.011","volume":"112","author":"RSF Bravo","year":"2012","unstructured":"Bravo, R.S.F., Klein, S., Nogueira, L.T., Protti, F., Sampaio, R.M.: Partitioning extended $$P_4$$-laden graphs into cliques and stable sets. Inf. Process. Lett. 112(21), 829\u2013834 (2012). https:\/\/doi.org\/10.1016\/j.ipl.2012.07.011","journal-title":"Inf. Process. Lett."},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"Bravo, R.S.F., Klein, S., Nogueira, L.T., Protti, F.: Clique cycle transversals in graphs with few $$P_4$$\u2019s. Discret. Math. Theor. Comput. Sci. 15, 13\u201320 (2013). https:\/\/doi.org\/10.46298\/dmtcs.616","DOI":"10.46298\/dmtcs.616"},{"issue":"01","key":"19_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1142\/S0129054121500027","volume":"32","author":"PP Camargo","year":"2021","unstructured":"Camargo, P.P., Souza, U.S., Nascimento, J.R.: Remarks on k-clique, k-independent set and 2-contamination in complementary prisms. Int. J. Found. Comput. Sci. 32(01), 37\u201352 (2021). https:\/\/doi.org\/10.1142\/S0129054121500027","journal-title":"Int. J. Found. Comput. Sci."},{"key":"19_CR5","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). https:\/\/doi.org\/10.1016\/j.tcs.2013.11.006","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"19_CR6","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 Discret. Methods 6(2), 268\u2013277 (1985). https:\/\/doi.org\/10.1137\/0606026","journal-title":"SIAM J. Algebraic Discret. Methods"},{"key":"19_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, 13\u201321 (1981). https:\/\/doi.org\/10.1002\/net.3230110103","journal-title":"Networks"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"DG Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discret. Appl. Math. 3, 163\u2013174 (1981). https:\/\/doi.org\/10.1016\/0166-218X(81)90013-5","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10878-015-9968-5","volume":"33","author":"MA Duarte","year":"2015","unstructured":"Duarte, M.A., Penso, L., Rautenbach, D., dos Santos Souza, U.: Complexity properties of complementary prisms. J. Comb. Optim. 33(2), 365\u2013372 (2015). https:\/\/doi.org\/10.1007\/s10878-015-9968-5","journal-title":"J. Comb. Optim."},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.tcs.2015.04.001","volume":"588","author":"MA Duarte","year":"2015","unstructured":"Duarte, M.A., Joos, F., Penso, L.D., Rautenbach, D., Souza, U.S.: Maximum induced matchings close to maximum matchings. Theor. Comput. Sci. 588, 131\u2013137 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.04.001","journal-title":"Theor. Comput. Sci."},{"key":"19_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. Combin. Appl. 51, 21\u201330 (2007)","journal-title":"Bull. Inst. Combin. Appl."},{"issue":"2","key":"19_CR12","first-page":"128","volume":"5","author":"P Heggernes","year":"1998","unstructured":"Heggernes, P., Telle, J.A.: Partitioning graphs into generalized dominating sets. Nordic J. Comput. 5(2), 128\u2013142 (1998)","journal-title":"Nordic J. Comput."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.tcs.2015.10.016","volume":"609","author":"D Kratsch","year":"2016","unstructured":"Kratsch, D., Le, V.B.: Algorithms solving the matching cut problem. Theor. Comput. Sci. 609, 328\u2013335 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2015.10.016","journal-title":"Theor. Comput. Sci."},{"key":"19_CR14","doi-asserted-by":"publisher","unstructured":"Lima, C.V.G.C., Rautenbach, D., Souza, U.S., Szwarcfiter, J.L.: On the computational complexity of the bipartizing matching problem. Ann. Oper. Res. 1\u201322 (2021). https:\/\/doi.org\/10.1007\/s10479-021-03966-9","DOI":"10.1007\/s10479-021-03966-9"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ipl.2017.04.003","volume":"124","author":"CV Lima","year":"2017","unstructured":"Lima, C.V., Rautenbach, D., Souza, U.S., Szwarcfiter, J.L.: Decycling with a matching. Inf. Process. Lett. 124, 26\u201329 (2017). https:\/\/doi.org\/10.1016\/j.ipl.2017.04.003","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"19_CR16","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1007\/s00373-021-02319-4","volume":"37","author":"JR Nascimento","year":"2021","unstructured":"Nascimento, J.R., Souza, U.S., Szwarcfiter, J.L.: Partitioning a graph into complementary subgraphs. Graphs Comb. 37(4), 1311\u20131331 (2021). https:\/\/doi.org\/10.1007\/s00373-021-02319-4","journal-title":"Graphs Comb."},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/3-540-45477-2_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Patrignani","year":"2001","unstructured":"Patrignani, M., Pizzonia, M.: The complexity of the matching-cut problem. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, pp. 284\u2013295. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45477-2_26"},{"issue":"18","key":"19_CR18","doi-asserted-by":"publisher","first-page":"2769","DOI":"10.1016\/j.dam.2012.01.025","volume":"160","author":"V Pedrotti","year":"2012","unstructured":"Pedrotti, V., De Mello, C.P.: Minimal separators in extended p4-laden graphs. Discret. Appl. Math. 160(18), 2769\u20132777 (2012). https:\/\/doi.org\/10.1016\/j.dam.2012.01.025","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/jgt.22239","volume":"89","author":"LD Penso","year":"2018","unstructured":"Penso, L.D., Rautenbach, D., Souza, U.S.: Graphs in which some and every maximum matching is uniquely restricted. J. Graph Theory 89(1), 55\u201363 (2018). https:\/\/doi.org\/10.1002\/jgt.22239","journal-title":"J. Graph Theory"},{"key":"19_CR20","doi-asserted-by":"publisher","unstructured":"Protti, F., Souza, U.S.: Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs. Discret. Math. Theor. Comput. Sci. 20(2) (2018). https:\/\/doi.org\/10.23638\/DMTCS-20-2-15","DOI":"10.23638\/DMTCS-20-2-15"},{"issue":"2\u20133","key":"19_CR21","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0166-218X(03)00446-3","volume":"136","author":"B Randerath","year":"2004","unstructured":"Randerath, B., Schiermeyer, I.: $$3$$-Colorability $$\\in $$ P for $$P_6$$-free graphs. Discret. Appl. Math. 136(2\u20133), 299\u2013313 (2004). https:\/\/doi.org\/10.1016\/S0166-218X(03)00446-3","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06678-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:06:33Z","timestamp":1653779193000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}