{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T13:18:04Z","timestamp":1778591884701,"version":"3.51.4"},"reference-count":24,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12571363"],"award-info":[{"award-number":["12571363"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Hunan Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["2025JJ30003"],"award-info":[{"award-number":["2025JJ30003"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.disc.2026.115132","type":"journal-article","created":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T08:58:50Z","timestamp":1774429130000},"page":"115132","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Number of copies of C4 guarantees strong structural stability of graphs forbidding C2k+1"],"prefix":"10.1016","volume":"349","author":[{"given":"Zilong","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuejian","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2026.115132_br0010","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90133-2","article-title":"On the connection between chromatic number, maximal clique and minimal degree of a graph","volume":"8","author":"Andrsf\u00e1i","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115132_br0020","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1017\/S0963548320000590","article-title":"Making Kr+1-free graphs r-partite","volume":"30","author":"Balogh","year":"2021","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/j.disc.2026.115132_br0030","series-title":"Some lotto numbers from an extension of Tur\u00e1n's theorem","author":"Brouwer","year":"1981"},{"key":"10.1016\/j.disc.2026.115132_br0050","series-title":"Theory of Graphs","first-page":"117","article-title":"Some recent results on extremal problems in graph theory (results)","author":"Erd\u0151s","year":"1966"},{"key":"10.1016\/j.disc.2026.115132_br0060","series-title":"Theory of Graphs","first-page":"77","article-title":"On some new inequalities concerning extremal properties of graphs","author":"Erd\u0151s","year":"1968"},{"key":"10.1016\/j.disc.2026.115132_br0080","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","article-title":"On maximal paths and circuits of graphs","volume":"10","author":"Erd\u0151s","year":"1959","journal-title":"Acta Math. Hung."},{"key":"10.1016\/j.disc.2026.115132_br0090","first-page":"51","article-title":"A limit theorem in graph theory","volume":"1","author":"Erd\u0151s","year":"1966","journal-title":"Studia Sci. Math. Hung."},{"key":"10.1016\/j.disc.2026.115132_br0100","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1090\/S0002-9904-1946-08715-7","article-title":"On the structure of linear graphs","volume":"52","author":"Erd\u0151s","year":"1946","journal-title":"Bull. Am. Math. Soc."},{"key":"10.1016\/j.disc.2026.115132_br0120","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.jctb.2015.05.001","article-title":"A proof of the stability of extremal graphs, Simonovits' stability from Szemer\u00e9di's regularity","volume":"115","author":"F\u00fcredi","year":"2015","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115132_br0130","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1017\/S0963548314000601","article-title":"Extremal numbers for odd cycles","volume":"24","author":"F\u00fcredi","year":"2015","journal-title":"Comb. Probab. Comput."},{"issue":"8","key":"10.1016\/j.disc.2026.115132_br0140","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2021.112445","article-title":"On Tur\u00e1n-good graphs","volume":"344","author":"Gerbner","year":"2021","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.disc.2026.115132_br0150","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/jgt.20505","article-title":"Dense graphs with small clique number","volume":"66","author":"Goddard","year":"2011","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115132_br0160","series-title":"Graph Theory","first-page":"89","article-title":"Odd cycles of specified length in nonbipartite graphs","volume":"vol. 62","author":"H\u00e4ggkvist","year":"1982"},{"issue":"1","key":"10.1016\/j.disc.2026.115132_br0170","doi-asserted-by":"crossref","DOI":"10.1007\/s40840-023-01602-2","article-title":"The cycle of length four is strictly F-Tur\u00e1n-good","volume":"47","author":"Hei","year":"2024","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"10.1016\/j.disc.2026.115132_br0190","article-title":"Exact stability for Tur\u00e1n's theorem","volume":"9","author":"Kor\u00e1ndi","year":"2021","journal-title":"Adv. Comb."},{"key":"10.1016\/j.disc.2026.115132_br0200","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2019.103026","article-title":"Some sharp results on the generalized Tur\u00e1n numbers","volume":"84","author":"Ma","year":"2020","journal-title":"Eur. J. Comb."},{"issue":"2","key":"10.1016\/j.disc.2026.115132_br0210","doi-asserted-by":"crossref","first-page":"1733","DOI":"10.1137\/23M158718X","article-title":"A stability result for C2k+1-free graphs","volume":"38","author":"Ren","year":"2024","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2026.115132_br0220","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.ejc.2018.07.004","article-title":"Stability results for graphs with a critical edge","volume":"94","author":"Roberts","year":"2018","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115132_br0230","series-title":"Theory of Graphs","first-page":"279","article-title":"A method for solving extremal problems in graph theory, stability problems","author":"Simonovits","year":"1968"},{"key":"10.1016\/j.disc.2026.115132_br0250","first-page":"436","article-title":"Eine Extremalaufgabe aus der Graphentheorie","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Mat. Fiz. Lapok"},{"key":"10.1016\/j.disc.2026.115132_br0260","unstructured":"Z. Yan, Y. Peng, X. Yuan, Chromatic profiles of odd cycles, under review."},{"key":"10.1016\/j.disc.2026.115132_br0270","doi-asserted-by":"crossref","DOI":"10.1002\/jgt.70022","article-title":"A strong structural stability of C2k+1-free graphs","author":"Yan","year":"2026","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115132_br0280","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/jgt.23086","article-title":"Minimum degree stability of C2k+1-free graphs","author":"Yuan","year":"2024","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115132_br0290","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2025.104143","article-title":"Tight bound on the minimum degree to guarantee graphs forbidding some odd cycles to be bipartite","volume":"127","author":"Yuan","year":"2025","journal-title":"Eur. J. Comb."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26001561?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26001561?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T12:56:03Z","timestamp":1778590563000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26001561"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":24,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["S0012365X26001561"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115132","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Number of copies of C4 guarantees strong structural stability of graphs forbidding C2k+1","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115132","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115132"}}