{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T07:11:28Z","timestamp":1772521888955,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11931006"],"award-info":[{"award-number":["11931006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Postgraduate Research and Practice Innovation Program of Jiangsu Province","award":["KYCX24_1784"],"award-info":[{"award-number":["KYCX24_1784"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s00373-025-02889-7","type":"journal-article","created":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T12:36:50Z","timestamp":1737549410000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maximum Bisections of Graphs Without Adjacent Quadrilaterals"],"prefix":"10.1007","volume":"41","author":[{"given":"Qiming","family":"Hu","sequence":"first","affiliation":[]},{"given":"Baogang","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"issue":"3","key":"2889_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01261315","volume":"16","author":"N Alon","year":"1996","unstructured":"Alon, N.: Bipartite subgraphs. Combinatorica 16(3), 301\u2013311 (1996)","journal-title":"Combinatorica"},{"issue":"1","key":"2889_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0012-365X(97)00041-1","volume":"181","author":"N Alon","year":"1998","unstructured":"Alon, N., Halperin, E.: Bipartite subgraphs of integer weighted graphs. Discrete Math. 181(1), 19\u201329 (1998)","journal-title":"Discrete Math."},{"issue":"5\u20136","key":"2889_CR3","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1017\/S0963548305007017","volume":"14","author":"N Alon","year":"2005","unstructured":"Alon, N., Krivelevich, M., Sudakov, B.: MaxCut in $$H$$-free graphs. Combin. Probab. Comput. 14(5\u20136), 629\u2013647 (2005)","journal-title":"Combin. Probab. Comput."},{"issue":"3","key":"2889_CR4","doi-asserted-by":"publisher","first-page":"475","DOI":"10.4153\/CJM-1973-048-x","volume":"25","author":"C Edwards","year":"1973","unstructured":"Edwards, C.: Some extremal properties of bipartite subgraphs. Can. J. Math. 25(3), 475\u2013485 (1973)","journal-title":"Can. J. Math."},{"key":"2889_CR5","unstructured":"Edwards, C.: An improved lower bound for the number of edges in a largest bipartite subgraph. In: Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague, 1974), pp. 167\u2013181. Academia, Prague (1975)"},{"issue":"1","key":"2889_CR6","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1017\/S0963548317000487","volume":"27","author":"G Fan","year":"2018","unstructured":"Fan, G., Hou, J., Yu, X.: Bisections of graphs without short cycles. Combin. Probab. Comput. 27(1), 44\u201359 (2018)","journal-title":"Combin. Probab. Comput."},{"issue":"4","key":"2889_CR7","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1002\/jgt.22717","volume":"98","author":"J Hou","year":"2021","unstructured":"Hou, J., Wu, S.: On bisections of graphs without complete bipartite graphs. J. Graph Theory 98(4), 630\u2013641 (2021)","journal-title":"J. Graph Theory"},{"key":"2889_CR8","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.ejc.2017.02.004","volume":"63","author":"J Hou","year":"2017","unstructured":"Hou, J., Wu, S., Yan, G.: On bisections of directed graphs. Eur. J. Combin. 63, 44\u201358 (2017)","journal-title":"Eur. J. Combin."},{"key":"2889_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2021.105404","volume":"180","author":"J Lin","year":"2021","unstructured":"Lin, J., Zeng, Q.: Maximum bisections of graphs without short even cycles. J. Combin. Theory Ser. A 180, 105404 (2021)","journal-title":"J. Combin. Theory Ser. A"},{"key":"2889_CR10","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.dam.2021.12.031","volume":"311","author":"J Lin","year":"2022","unstructured":"Lin, J., Zeng, Q.: Maximum bipartite subgraphs in graphs without short cycles. Discrete Appl. Math. 311, 18\u201325 (2022)","journal-title":"Discrete Appl. Math."},{"issue":"8","key":"2889_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.112914","volume":"345","author":"M Rao","year":"2022","unstructured":"Rao, M., Hou, J., Zeng, Q.: Maximum bisections of graphs without cycles of length 4. Discrete Math. 345(8), 112914 (2022)","journal-title":"Discrete Math."},{"key":"2889_CR12","doi-asserted-by":"crossref","unstructured":"Scott, A.: Judicious partitions and related problems, pp. 95\u2013118. London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge (2005)","DOI":"10.1017\/CBO9780511734885.006"},{"issue":"2","key":"2889_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/rsa.3240030211","volume":"3","author":"JB Shearer","year":"1992","unstructured":"Shearer, J.B.: A note on bipartite subgraphs of triangle-free graphs. Random Struct. Algorithms 3(2), 223\u2013226 (1992)","journal-title":"Random Struct. Algorithms"},{"key":"2889_CR14","doi-asserted-by":"crossref","unstructured":"Xu, B., Yan, J., Yu, X.: A note on balanced bipartitions. Discrete Math. 310(20):2613\u20132617 (2010). Graph Theory\u2014Dedicated to Carsten Thomassen on his 60th Birthday","DOI":"10.1016\/j.disc.2010.03.029"},{"issue":"1","key":"2889_CR15","doi-asserted-by":"publisher","first-page":"147","DOI":"10.26493\/1855-3974.1218.5ed","volume":"15","author":"Q Zeng","year":"2018","unstructured":"Zeng, Q., Hou, J.: Maximum cuts of graphs with forbidden cycles. Ars Math. Contemp. 15(1), 147\u2013160 (2018)","journal-title":"Ars Math. Contemp."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02889-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02889-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02889-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:22:45Z","timestamp":1748319765000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02889-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,22]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2889"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02889-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,22]]},"assertion":[{"value":"26 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"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":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"29"}}