{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:04:56Z","timestamp":1757617496405,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610891"},{"type":"electronic","value":"9789819610907"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1090-7_26","type":"book-chapter","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:32:45Z","timestamp":1741105965000},"page":"314-325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bipartite Domination in\u00a0Outerplanar Graphs"],"prefix":"10.1007","author":[{"given":"Changqing","family":"Xi","sequence":"first","affiliation":[]},{"given":"Jun","family":"Yue","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"issue":"2","key":"26_CR1","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1002\/jgt.22217","volume":"88","author":"JD Alvarado","year":"2018","unstructured":"Alvarado, J.D., Dantas, S., Rautenbach, D.: Dominating sets inducing large components in maximal outerplanar graphs. J. Graph Theory 88(2), 356\u2013370 (2018)","journal-title":"J. Graph Theory"},{"issue":"4","key":"26_CR2","doi-asserted-by":"publisher","first-page":"112784","DOI":"10.1016\/j.disc.2021.112784","volume":"345","author":"A Babikir","year":"2022","unstructured":"Babikir, A., Henning, M.A.: Domination versus total domination in claw-free cubic graphs. Discrete Math. 345(4), 112784 (2022)","journal-title":"Discrete Math."},{"issue":"S2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1556\/314.2022.00015","volume":"28","author":"A Bachstein","year":"2022","unstructured":"Bachstein, A., Goddard, W., Henning, M.A.: Bipartite domination in graphs. Math. Pannon. 28(S2), 118\u2013126 (2022)","journal-title":"Math. Pannon."},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, Graduate Texts in Mathematics, vol. 244. Springer (2008)","DOI":"10.1007\/978-1-84628-970-5"},{"issue":"1","key":"26_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556788.2019.1679142","volume":"37","author":"Q Cai","year":"2022","unstructured":"Cai, Q., Fan, N., Shi, Y., Yao, S.: Integer linear programming formulations for double roman domination problem. Optim. Method. Softw. 37(1), 1\u201322 (2022)","journal-title":"Optim. Method. Softw."},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"1180","DOI":"10.1016\/j.disc.2015.11.003","volume":"339","author":"M Dorfling","year":"2016","unstructured":"Dorfling, M., Hattingh, J.H., Jonck, E.: Total domination in maximal outerplanar graphs II. Discrete Math. 339, 1180\u20131188 (2016)","journal-title":"Discrete Math."},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"112546","DOI":"10.1016\/j.disc.2021.112546","volume":"344","author":"MH Fakharan","year":"2021","unstructured":"Fakharan, M.H., Gorzin, A.A., Henning, M.A., Jafari, A., Touserkani, R.: On (1,2)-domination in cubic graphs. Discrete Math. 344, 112546 (2021)","journal-title":"Discrete Math."},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"239","DOI":"10.7151\/dmgt.1228","volume":"24","author":"W Goddard","year":"2004","unstructured":"Goddard, W., Haynes, T.W., Knisely, D.: Hereditary domination and independence parameters. Discuss. Math. Graph Theory 24, 239\u2013248 (2004)","journal-title":"Discuss. Math. Graph Theory"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.dam.2022.02.003","volume":"313","author":"W Goddard","year":"2022","unstructured":"Goddard, W., Henning, M.A.: Domination and dominator colorings in planar graphs with small diameter. Discrete Appl. Math. 313, 80\u201392 (2022)","journal-title":"Discrete Appl. Math."},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.dam.2022.10.003","volume":"325","author":"W Goddard","year":"2023","unstructured":"Goddard, W., Henning, M.A.: Independent domination in outerplanar graphs. Discrete Appl. Math. 325, 52\u201357 (2023)","journal-title":"Discrete Appl. Math."},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s00373-020-02145-0","volume":"36","author":"TW Haynes","year":"2020","unstructured":"Haynes, T.W., Henning, M.A.: Trees with unique minimum semitotal dominating sets. Graphs Combin. 36, 689\u2013702 (2020)","journal-title":"Graphs Combin."},{"key":"26_CR12","first-page":"239","volume":"6","author":"JT Hedetniemi","year":"2009","unstructured":"Hedetniemi, J.T., Hedetniemi, K.D., Hedetniemi, S.M., Hedetniemi, S.T.: Secondary and internal distances of sets in graphs. AKCE Int. J. Graphs Comb. 6, 239\u2013266 (2009)","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0012-365X(00)00012-1","volume":"222","author":"SM Hedetniemi","year":"2000","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Rall, D.F.: Acyclic domination. Discrete Math. 222, 151\u2013165 (2000)","journal-title":"Discrete Math."},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1137\/S089548019828371X","volume":"16","author":"CW Ko","year":"2003","unstructured":"Ko, C.W., Shepherd, F.B.: Bipartite domination and simultaneous matroid covers. SIAM J. Discrete Math. 16, 517\u2013523 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"113228","DOI":"10.1016\/j.disc.2022.113228","volume":"346","author":"P Mafuta","year":"2023","unstructured":"Mafuta, P., Mukwembi, S., Rodrigues, B.G.: A note on connected domination number and leaf number. Discrete Math. 346, 113228 (2023)","journal-title":"Discrete Math."},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1006\/eujc.1996.0048","volume":"17","author":"LR Matheson","year":"1996","unstructured":"Matheson, L.R., Tarjan, R.E.: Dominating sets in planar graphs. Eur. J. Combin. 17, 565\u2013568 (1996)","journal-title":"Eur. J. Combin."},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1002\/jgt.3190130610","volume":"13","author":"W McCuaig","year":"1989","unstructured":"McCuaig, W., Shepherd, B.: Domination in graphs with minimum degree two. J. Graph Theory 13, 749\u2013762 (1989)","journal-title":"J. Graph Theory"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.jctb.2019.11.005","volume":"143","author":"S \u0160pacapan","year":"2020","unstructured":"\u0160pacapan, S.: The domination number of plane triangulations. J. Combin. Theory Ser. B 143, 42\u201364 (2020)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"26_CR19","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/s00373-015-1580-z","volume":"32","author":"O Suil","year":"2016","unstructured":"Suil, O., West, D.B.: Cubic graphs with large ratio of independent domination number to domination number. Graphs Combin. 32(2), 773\u2013776 (2016)","journal-title":"Graphs Combin."},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"3091","DOI":"10.1016\/j.dam.2013.06.025","volume":"161","author":"S Tokunaga","year":"2013","unstructured":"Tokunaga, S.: Dominating sets of maximal outerplanar graphs. Discrete Appl. Math. 161, 3091\u20133099 (2013)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1090-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T07:08:37Z","timestamp":1757142517000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1090-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610891","9789819610907"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1090-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}