{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T21:16:54Z","timestamp":1783199814234,"version":"3.54.6"},"reference-count":14,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,5,19]],"date-time":"2027-05-19T00:00:00Z","timestamp":1810684800000},"content-version":"am","delay-in-days":230,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2154331"],"award-info":[{"award-number":["DMS-2154331"]}],"id":[{"id":"10.13039\/100000001","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,10]]},"DOI":"10.1016\/j.disc.2026.115224","type":"journal-article","created":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:21:02Z","timestamp":1779175262000},"page":"115224","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Strong binding numbers and factors"],"prefix":"10.1016","volume":"349","author":[{"given":"Guantao","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikhail","family":"Lavrov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-2434-3000","authenticated-orcid":false,"given":"Yuying","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jennifer","family":"Vandenbussche","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hein","family":"van der Holst","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.disc.2026.115224_br0010","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0095-8956(71)90041-4","article-title":"Perfect matchings of a graph","volume":"10","author":"Anderson","year":"1971","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"9","key":"10.1016\/j.disc.2026.115224_br0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.114079","article-title":"The double Hall property and cycle covers in bipartite graphs","volume":"347","author":"Bar\u00e1t","year":"2024","journal-title":"Discrete Math."},{"issue":"0","key":"10.1016\/j.disc.2026.115224_br0030","doi-asserted-by":"crossref","first-page":"38","DOI":"10.3934\/fcnt.2026005","article-title":"Bipartite graphs with the double Hall property","volume":"1","author":"Chen","year":"2026","journal-title":"Front. Comb. Number Theory"},{"key":"10.1016\/j.disc.2026.115224_br0040","author":"Chen"},{"key":"10.1016\/j.disc.2026.115224_br0050","series-title":"Graph Theory","author":"Diestel","year":"2005"},{"issue":"10","key":"10.1016\/j.disc.2026.115224_br0060","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2023.113578","article-title":"Existence of 2-factors in tough graphs without forbidden subgraphs","volume":"346","author":"Grimm","year":"2023","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/j.disc.2026.115224_br0070","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1137\/120886443","article-title":"An optimal binding number condition for bipancyclism","volume":"27","author":"Hu","year":"2013","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2026.115224_br0080","first-page":"2","article-title":"Vizing's 2-factor conjecture involving toughness and maximum degree conditions","author":"Kanno","year":"2019","journal-title":"Electron. J. Comb."},{"issue":"2","key":"10.1016\/j.disc.2026.115224_br0090","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1093\/qmath\/38.2.221","article-title":"Binding numbers of graphs and the existence of k-factors","volume":"38","author":"Katerinis","year":"1987","journal-title":"Q. J. Math."},{"issue":"3","key":"10.1016\/j.disc.2026.115224_br0100","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0095-8956(77)90066-1","article-title":"Disjoint matchings of graphs","volume":"22","author":"Lebensold","year":"1977","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"ne","key":"10.1016\/j.disc.2026.115224_br0110","first-page":"193","article-title":"Die Theorie der regul\u00e4ren graphs","volume":"15","author":"Petersen","year":"1900","journal-title":"Acta Math."},{"issue":"4","key":"10.1016\/j.disc.2026.115224_br0120","first-page":"477","article-title":"Two sufficient conditions for the existence of k-factors in bipartite graphs","volume":"36","author":"Qian","year":"2001","journal-title":"J. Shandong Univ. Nat. Sci. Ed."},{"key":"10.1016\/j.disc.2026.115224_br0130","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","article-title":"A short proof of the factor theorem for finite graphs","volume":"6","author":"Tutte","year":"1954","journal-title":"Can. J. Math."},{"issue":"3","key":"10.1016\/j.disc.2026.115224_br0140","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0095-8956(73)90038-5","article-title":"The binding number of a graph and its Anderson number","volume":"15","author":"Woodall","year":"1973","journal-title":"J. Comb. Theory, Ser. B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26002487?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26002487?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T20:58:16Z","timestamp":1783198696000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26002487"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":14,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["S0012365X26002487"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115224","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Strong binding numbers and factors","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115224","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":"115224"}}