{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:32:15Z","timestamp":1742977935470,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046507"},{"type":"electronic","value":"9783030046514"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_14","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"198-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bipartizing with a Matching"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6666-0533","authenticated-orcid":false,"given":"Carlos V. G. C.","family":"Lima","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7214-042X","authenticated-orcid":false,"given":"Dieter","family":"Rautenbach","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5320-9209","authenticated-orcid":false,"given":"U\u00e9verton S.","family":"Souza","sequence":"additional","affiliation":[]},{"given":"Jayme L.","family":"Szwarcfiter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"key":"14_CR1","unstructured":"Andrews, J., Jacobson, M.: On a generalization of chromatic number. In: Proceedings of Sixteenth Southeastern International Conference on Combinatorics, Graph Theory and Computing (SEICCGTC 1985), vol. 47, pp. 18\u201333 (1985)"},{"issue":"3","key":"14_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.7155\/jgaa.00418","volume":"21","author":"P Angelini","year":"2017","unstructured":"Angelini, P., et al.: Vertex-coloring with defects. J. Graph Algor. Appl. 21(3), 313\u2013340 (2017). https:\/\/doi.org\/10.7155\/jgaa.00418","journal-title":"J. Graph Algor. Appl."},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1002\/jgt.22093","volume":"85","author":"M Axenovich","year":"2017","unstructured":"Axenovich, M., Ueckerdt, T., Weiner, P.: Splitting planar graphs of girth 6 into two linear forests with short paths. J. Graph Theory 85(3), 601\u2013618 (2017). https:\/\/doi.org\/10.1002\/jgt.22093","journal-title":"J. Graph Theory"},{"issue":"1\u20132","key":"14_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial $$k$$-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1\u20132), 1\u201345 (1998). https:\/\/doi.org\/10.1016\/S0304-3975(97)00228-4","journal-title":"Theor. Comput. Sci."},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Bonamy, M., Dabrowski, K.K., Feghali, C., Johnson, M., Paulusma, D.: Independent feedback vertex set for $$P_5$$-free graphs. Algorithmica (2018). https:\/\/doi.org\/10.1007\/s00453-018-0474-x","DOI":"10.1007\/s00453-018-0474-x"},{"issue":"4","key":"14_CR6","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1002\/jgt.3190100407","volume":"10","author":"JA Bondy","year":"1986","unstructured":"Bondy, J.A., Locke, S.C.: Largest bipartite subgraphs in triangle-free graphs with maximum degree three. J. Graph Theory 10(4), 477\u2013504 (1986)","journal-title":"J. Graph Theory"},{"issue":"22","key":"14_CR7","doi-asserted-by":"publisher","first-page":"2638","DOI":"10.1016\/j.disc.2013.07.014","volume":"313","author":"O Borodin","year":"2013","unstructured":"Borodin, O., Kostochka, A., Yancey, M.: On $$1$$-improper $$2$$-coloring of sparse graphs. Discrete Math. 313(22), 2638\u20132649 (2013). https:\/\/doi.org\/10.1016\/j.disc.2013.07.014","journal-title":"Discrete Math."},{"issue":"5","key":"14_CR8","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s00224-004-1154-6","volume":"38","author":"A Brandst\u00e4dt","year":"2005","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Le, H., Mosca, R.: New graph classes of bounded clique-width. Theory Comput. Syst. 38(5), 623\u2013645 (2005). https:\/\/doi.org\/10.1007\/s00224-004-1154-6","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"14_CR9","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s00224-005-1199-1","volume":"39","author":"A Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Engelfriet, J., Le, H., Lozin, V.V.: Clique-width for $$4$$-vertex forbidden subgraphs. Theory Comput. Syst. 39(4), 561\u2013590 (2006)","journal-title":"Theory Comput. Syst."},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.46298\/dmtcs.372","volume":"8","author":"A Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Klembt, T., Mahfud, S.: $$P_6$$- and triangle-free graphs revisited: structure and bounded clique-width. Discrete Math. Theor. Comput. Sci. 8, 173\u2013188 (2006)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"13","key":"14_CR11","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1016\/j.dam.2006.03.031","volume":"154","author":"P Burzyn","year":"2006","unstructured":"Burzyn, P., Bonomo, F., Dur\u00e1n, G.: NP-completeness results for edge modification problems. Discrete Appl. Math. 154(13), 1824\u20131844 (2006). https:\/\/doi.org\/10.1016\/j.dam.2006.03.031","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s00453-015-9989-6","volume":"75","author":"E Camby","year":"2016","unstructured":"Camby, E., Schaudt, O.: A new characterization of $$P_k$$-free graphs. Algorithmica 75(1), 205\u2013217 (2016). https:\/\/doi.org\/10.1007\/s00453-015-9989-6","journal-title":"Algorithmica"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-319-62389-4_7","volume-title":"Computing and Combinatorics","author":"ADA Carneiro","year":"2017","unstructured":"Carneiro, A.D.A., Protti, F., Souza, U.S.: Deletion graph problems based on deadlock resolution. In: Cao, Y., Chen, J. (eds.) COCOON 2017. LNCS, vol. 10392, pp. 75\u201386. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62389-4_7"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1137\/0402004","volume":"2","author":"HA Choi","year":"1989","unstructured":"Choi, H.A., Nakajima, K., Rim, C.S.: Graph bipartization and via minimization. SIAM J. Discrete Math. 2(1), 38\u201347 (1989). https:\/\/doi.org\/10.1137\/0402004","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"14_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/(SICI)1097-0118(199703)24:3<205::AID-JGT2>3.0.CO;2-T","volume":"24","author":"L Cowen","year":"1997","unstructured":"Cowen, L., Goddard, W., Jesurum, C.E.: Defective coloring revisited. J. Graph Theory 24(3), 205\u2013219 (1997)","journal-title":"J. Graph Theory"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/jgt.3190100207","volume":"10","author":"LJ Cowen","year":"1986","unstructured":"Cowen, L.J., Cowen, R., Woodall, D.: Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency. J. Graph Theory 10(2), 187\u2013195 (1986)","journal-title":"J. Graph Theory"},{"key":"14_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory. Springer, Heidelberg (2017)"},{"key":"14_CR19","first-page":"79","volume":"25","author":"N Eaton","year":"1999","unstructured":"Eaton, N., Hull, T.: Defective list colorings of planar graphs. Bull. Inst. Combin. Appl 25, 79\u201387 (1999)","journal-title":"Bull. Inst. Combin. Appl"},{"issue":"2","key":"14_CR20","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02760037","volume":"3","author":"P Erd\u0151s","year":"1965","unstructured":"Erd\u0151s, P.: On some extremal problems in graph theory. Israel J. Math. 3(2), 113\u2013116 (1965)","journal-title":"Israel J. Math."},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.dam.2015.10.036","volume":"209","author":"H Furma\u0144czyk","year":"2016","unstructured":"Furma\u0144czyk, H., Kubale, M., Radziszowski, S.: On bipartization of cubic graphs by removal of an independent set. Discrete Appl. Math. 209, 115\u2013121 (2016)","journal-title":"Discrete Appl. Math."},{"issue":"03","key":"14_CR22","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1142\/S0129054100000260","volume":"11","author":"MC Golumbic","year":"2000","unstructured":"Golumbic, M.C., Rotics, U.: On the clique-width of some perfect graph classes. Int. J. Found. Comput. Sci. 11(03), 423\u2013443 (2000). https:\/\/doi.org\/10.1142\/S0129054100000260","journal-title":"Int. J. Found. Comput. Sci."},{"key":"14_CR23","first-page":"205","volume":"50","author":"F Harary","year":"1985","unstructured":"Harary, F., Jones, K.: Conditional colorability ii: bipartite variations. Congr. Numer. 50, 205\u2013218 (1985)","journal-title":"Congr. Numer."},{"issue":"4","key":"14_CR24","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM 21(4), 549\u2013568 (1974)","journal-title":"J. ACM"},{"issue":"1","key":"14_CR25","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00453-011-9554-x","volume":"64","author":"M Lampis","year":"2012","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. Algorithmica 64(1), 19\u201337 (2012). https:\/\/doi.org\/10.1007\/s00453-011-9554-x","journal-title":"Algorithmica"},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ipl.2017.04.003","volume":"124","author":"CVGC Lima","year":"2017","unstructured":"Lima, C.V.G.C., Rautenbach, D., Souza, U.S., Szwarcfiter, J.L.: Decycling with a matching. Inf. Proc. Lett. 124, 26\u201329 (2017). https:\/\/doi.org\/10.1016\/j.ipl.2017.04.003","journal-title":"Inf. Proc. Lett."},{"key":"14_CR27","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2015.01.049","volume":"573","author":"Y Liu","year":"2015","unstructured":"Liu, Y., Wang, J., You, J., Chen, J., Cao, Y.: Edge deletion problems: branching facilitated by modular decomposition. Theor. Comput. Sci. 573, 63\u201370 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR28","first-page":"237","volume":"1","author":"L Lov\u00e1sz","year":"1966","unstructured":"Lov\u00e1sz, L.: On decomposition of graphs. Studia Sci. Math. Hungar. 1, 237\u2013238 (1966)","journal-title":"Studia Sci. Math. Hungar."},{"issue":"2","key":"14_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1346330.1346336","volume":"55","author":"W Mulzer","year":"2008","unstructured":"Mulzer, W., Rote, G.: Minimum-weight triangulation is NP-hard. J. ACM 55(2), 1\u201329 (2008)","journal-title":"J. ACM"},{"key":"14_CR30","unstructured":"Protti, F., Souza, U.S.: Decycling a graph by the removal of a matching: characterizations for special classes. CoRR abs\/1707.02473 (2017). http:\/\/arxiv.org\/abs\/1707.02473"},{"issue":"3","key":"14_CR31","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"Neil Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.: Graph minors. ii. Algorithmic aspects of tree-width. J. Algorith. 7(3), 309\u2013322 (1986). https:\/\/doi.org\/10.1016\/0196-6774(86)90023-4","journal-title":"Journal of Algorithms"},{"key":"14_CR32","doi-asserted-by":"publisher","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings 10th Symposium on Theory of Computing (STOC 1978), pp. 216\u2013226. ACM Press, New York (1978). https:\/\/doi.org\/10.1145\/800133.804350","DOI":"10.1145\/800133.804350"},{"issue":"2","key":"14_CR33","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1997.2697","volume":"142","author":"M Thorup","year":"1998","unstructured":"Thorup, M.: All structured programs have small tree width and good register allocation. Inf. Comput. 142(2), 159\u2013181 (1998). https:\/\/doi.org\/10.1006\/inco.1997.2697","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:47:51Z","timestamp":1710344871000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}