{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T23:15:27Z","timestamp":1783638927381,"version":"3.55.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"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","id":[{"id":"10.13039\/501100001809","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,12]]},"DOI":"10.1016\/j.disc.2026.115323","type":"journal-article","created":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T10:46:54Z","timestamp":1783507614000},"page":"115323","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["On saturation problems for matchings with regularity constraints"],"prefix":"10.1016","volume":"349","author":[{"given":"Gang","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3269-9157","authenticated-orcid":false,"given":"Zixuan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shenggui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.disc.2026.115323_br0010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/(SICI)1097-0118(199609)23:1<1::AID-JGT1>3.0.CO;2-O","article-title":"On k-saturated graphs with restrictions on the degrees","volume":"23","author":"Alon","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115323_br0020","article-title":"Graph Theory","volume":"vol. 244","author":"Bondy","year":"2008"},{"key":"10.1016\/j.disc.2026.115323_br0030","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/jgt.22857","article-title":"Regular Tur\u00e1n numbers and some Gan-Loh-Sudakov-type problems","volume":"102","author":"Cambie","year":"2023","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115323_br0040","first-page":"133","article-title":"Regular Tur\u00e1n numbers","volume":"78","author":"Caro","year":"2020","journal-title":"Australas. J. Comb."},{"key":"10.1016\/j.disc.2026.115323_br0050","article-title":"Generalized sum-free sets and cycle saturated regular graphs","volume":"22","author":"Davini","year":"2022","journal-title":"Integers"},{"issue":"2","key":"10.1016\/j.disc.2026.115323_br0060","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1017\/S0963548316000377","article-title":"Saturated graphs of prescribed minimum degree","volume":"26","author":"Day","year":"2017","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"10.1016\/j.disc.2026.115323_br0070","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/jgt.3190100109","article-title":"Minimal k-saturated and color critical graphs of prescribed minimum degree","volume":"10","author":"Duffus","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115323_br0080","article-title":"Dynamic cage survey","volume":"DS16","author":"Exoo","year":"2008","journal-title":"Electron. J. Comb."},{"issue":"1","key":"10.1016\/j.disc.2026.115323_br0090","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1002\/jgt.3190180103","article-title":"Maximal triangle-free graphs with restrictions on the degrees","volume":"18","author":"F\u00fcredi","year":"1994","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115323_br0100","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.7151\/dmgt.2335","article-title":"Singular Tur\u00e1n numbers and WORM-colorings","volume":"42","author":"Gerbner","year":"2022","journal-title":"Discuss. Math., Graph Theory"},{"key":"10.1016\/j.disc.2026.115323_br0110","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2022.112921","article-title":"Saturation problems with regularity constraints","volume":"345","author":"Gerbner","year":"2022","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115323_br0120","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2023.103828","article-title":"Some exact results for regular Tur\u00e1n problems","volume":"117","author":"Gerbner","year":"2024","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115323_br0130","first-page":"169","article-title":"k-saturated graphs of prescribed maximum degree","volume":"42","author":"Hanson","year":"1984","journal-title":"Congr. Numer."},{"key":"10.1016\/j.disc.2026.115323_br0140","article-title":"Matching Theory","volume":"vol. 29","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/j.disc.2026.115323_br0150","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2021.112531","article-title":"Regular Tur\u00e1n numbers of complete bipartite graphs","volume":"344","author":"Tait","year":"2021","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115323_br0160","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2021.112659","article-title":"Regular saturated graphs and sum-free sets","volume":"345","author":"Timmons","year":"2022","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X2600347X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X2600347X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T22:39:13Z","timestamp":1783636753000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X2600347X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":16,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["S0012365X2600347X"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115323","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On saturation problems for matchings with regularity constraints","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115323","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":"115323"}}