{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T18:24:32Z","timestamp":1759602272230,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T00:00:00Z","timestamp":1654214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T00:00:00Z","timestamp":1654214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Natural Science Foundation of Fujian Province","award":["2021J05128"],"award-info":[{"award-number":["2021J05128"]}]},{"DOI":"10.13039\/501100001809","name":"nsfc","doi-asserted-by":"crossref","award":["12001106"],"award-info":[{"award-number":["12001106"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"foundation of fuzhou university","award":["GXRC-20059"],"award-info":[{"award-number":["GXRC-20059"]}]},{"DOI":"10.13039\/501100001809","name":"nsfc","doi-asserted-by":"crossref","award":["12071077"],"award-info":[{"award-number":["12071077"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s00373-022-02499-7","type":"journal-article","created":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T13:04:13Z","timestamp":1654261453000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Odd Induced Subgraphs in Planar Graphs with Large Girth"],"prefix":"10.1007","volume":"38","author":[{"given":"Mengjiao","family":"Rao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianfeng","family":"Hou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinghou","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,3]]},"reference":[{"key":"2499_CR1","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.2371","author":"A Aashtab","year":"2020","unstructured":"Aashtab, A., Akbari, S., Ghanbari, M.: Vertex partitioning of graphs into odd induced subgraphs. Discuss. Math. Graph Theory (2020). https:\/\/doi.org\/10.7151\/dmgt.2371. (in press)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2499_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0012-365X(96)00283-X","volume":"175","author":"DM Berman","year":"1997","unstructured":"Berman, D.M., Radcliffe, A.J., Scott, A.D., Wang, H., Wargo, L.: All trees contain a large induced subgraph having all degrees 1 (mod $$k$$). Discret. Math. 175, 35\u201340 (1997)","journal-title":"Discret. Math."},{"key":"2499_CR3","first-page":"81","volume":"15","author":"DM Berman","year":"1997","unstructured":"Berman, D.M., Wang, H., Wargo, L.: Odd induced subgraphs in graphs of maximum degree three. Aust. J. Combin. 15, 81\u201385 (1997)","journal-title":"Aust. J. Combin."},{"key":"2499_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0012-365X(92)00563-7","volume":"132","author":"Y Caro","year":"1994","unstructured":"Caro, Y.: On induced subgraphs with odd degrees. Discret. Math. 132, 23\u201328 (1994)","journal-title":"Discret. Math."},{"key":"2499_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0012-365X(94)90149-X","volume":"125","author":"Y Caro","year":"1994","unstructured":"Caro, Y., Krasikov, I., Roditty, Y.: On induced subgraphs of trees with restricted degrees. Discret. Math. 125, 101\u2013106 (1994)","journal-title":"Discret. Math."},{"key":"2499_CR6","doi-asserted-by":"crossref","unstructured":"Ferber, A., Krivelevich, M.: Every graph contians a linearly sized induced subgraph with all degrees odd. arXiv:2009.05495v3 (2021)","DOI":"10.1016\/j.aim.2022.108534"},{"key":"2499_CR7","first-page":"109","volume":"8","author":"H Gr\u00f6tzsch","year":"1959","unstructured":"Gr\u00f6tzsch, H.: Ein Dreifarbenzatz f\u00fcr dreikreisfreie netze auf der Kugel. Math. Natur. Reihe 8, 109\u2013120 (1959)","journal-title":"Math. Natur. Reihe"},{"key":"2499_CR8","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s00373-018-1892-x","volume":"34","author":"X Hou","year":"2018","unstructured":"Hou, X., Yu, L., Li, J., Liu, B.: Odd induced subgraphs in graphs with treewidth at most two. Graphs Combin. 34, 535\u2013544 (2018)","journal-title":"Graphs Combin."},{"key":"2499_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11425-017-9314-x","volume":"63","author":"J Hou","year":"2020","unstructured":"Hou, J., Ma, H., Yu, X., Zhang, X.: A bound on judicious bipartitions of directed graphs. Sci. China Math. 63, 297\u2013308 (2020)","journal-title":"Sci. China Math."},{"key":"2499_CR10","doi-asserted-by":"publisher","first-page":"103039","DOI":"10.1016\/j.ejc.2019.103039","volume":"84","author":"J Hou","year":"2020","unstructured":"Hou, J., Li, Z., Wu, S.: On bipartitions of directed graphs with small semidegree. Eur. J. Combin. 84, 103039 (2020)","journal-title":"Eur. J. Combin."},{"key":"2499_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-021-0415-8","volume":"16","author":"Y Ji","year":"2022","unstructured":"Ji, Y., Liu, J., Bai, Y., Wu, S.: Full friendly index sets of $$mC_n$$. Front. Comput. Sci. 16, 163403 (2022)","journal-title":"Front. Comput. Sci."},{"key":"2499_CR12","volume-title":"Combinatorial Problems and Exercises","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: Combinatorial Problems and Exercises. North-Holland, Amsterdam (1979)"},{"key":"2499_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-020-9205-y","volume":"15","author":"Y Peng","year":"2021","unstructured":"Peng, Y., Lin, X., Choi, B., He, B.: VColor*: a practical approach for coloring large graphs. Front. Comput. Sci. 15, 154610 (2021)","journal-title":"Front. Comput. Sci."},{"key":"2499_CR14","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0012-365X(93)E0186-8","volume":"140","author":"AJ Radcliffe","year":"1995","unstructured":"Radcliffe, A.J., Scott, A.D.: Every tree contains a large induced subgraph with all degrees odd. Discret. Math. 140, 275\u2013279 (1995)","journal-title":"Discret. Math."},{"key":"2499_CR15","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1017\/S0963548300000389","volume":"1","author":"AD Scott","year":"1992","unstructured":"Scott, A.D.: Large induced subgraphs with all degrees odd. Combin. Probab. Comput. 1, 335\u2013349 (1992)","journal-title":"Combin. Probab. Comput."},{"key":"2499_CR16","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s003730170028","volume":"17","author":"AD Scott","year":"2001","unstructured":"Scott, A.D.: On induced subgraphs with all degrees odd. Graphs Combin. 17, 539\u2013553 (2001)","journal-title":"Graphs Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02499-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02499-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02499-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T13:15:32Z","timestamp":1660223732000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02499-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,3]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["2499"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02499-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,6,3]]},"assertion":[{"value":"19 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"105"}}