{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T05:40:52Z","timestamp":1781847652140,"version":"3.54.5"},"reference-count":36,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Shandong Province Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Jiangsu Province Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004608","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,11]]},"DOI":"10.1016\/j.disc.2026.115251","type":"journal-article","created":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T16:22:21Z","timestamp":1780417341000},"page":"115251","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Sufficient conditions for a graph with minimum degree to be k-critical with respect to an odd [1,b]-factor"],"prefix":"10.1016","volume":"349","author":[{"given":"Sizhong","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2026.115251_br0010","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0012-365X(02)00564-2","article-title":"Factor criticality and complete closure of graphs","volume":"265","author":"Ananchuen","year":"2003","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.disc.2026.115251_br0020","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"},{"key":"10.1016\/j.disc.2026.115251_br0030","series-title":"Graphs and Matrices","author":"Bapat","year":"2018"},{"key":"10.1016\/j.disc.2026.115251_br0040","series-title":"Spectra of Graphs","author":"Brouwer","year":"2012"},{"issue":"3","key":"10.1016\/j.disc.2026.115251_br0050","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1002\/jgt.3190120305","article-title":"Some results on odd factors of graphs","volume":"12","author":"Cui","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115251_br0060","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/jgt.21883","article-title":"Perfect matchings avoiding several independent edges in a star-free graph","volume":"82","author":"Egawa","year":"2016","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115251_br0070","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2023.103701","article-title":"Toughness, hamiltonicity and spectral radius in graphs","volume":"110","author":"Fan","year":"2023","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115251_br0080","doi-asserted-by":"crossref","first-page":"41","DOI":"10.7151\/dmgt.1022","article-title":"On k-factor-critical graphs","volume":"16","author":"Favaron","year":"1996","journal-title":"Discuss. Math., Graph Theory"},{"issue":"10","key":"10.1016\/j.disc.2026.115251_br0090","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":"7","key":"10.1016\/j.disc.2026.115251_br0100","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2021.112357","article-title":"2-factors of cubic bipartite graphs","volume":"344","author":"Haghparast","year":"2021","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115251_br0110","series-title":"Combinatorics, Graph Theory and Algorithms","first-page":"527","article-title":"Some results on (1,f)-odd factors","author":"Kano","year":"1999"},{"issue":"8","key":"10.1016\/j.disc.2026.115251_br0120","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2020.111906","article-title":"An odd [1,b]-factor in regular graphs from eigenvalues","volume":"343","author":"Kim","year":"2020","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115251_br0130","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1016\/j.disc.2006.01.018","article-title":"Fan-type results for the existence of [a,b]-factors","volume":"306","author":"Matsuda","year":"2006","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115251_br0140","article-title":"Nonnegative Matrices","author":"Min\u0107","year":"1988"},{"key":"10.1016\/j.disc.2026.115251_br0150","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/j.laa.2020.06.004","article-title":"Spectral radius and matchings in graphs","volume":"614","author":"O","year":"2021","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.disc.2026.115251_br0160","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF02988324","article-title":"Odd factors of a graph","volume":"9","author":"Topp","year":"1993","journal-title":"Graphs Comb."},{"key":"10.1016\/j.disc.2026.115251_br0170","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","article-title":"The factorization of linear graphs","volume":"22","author":"Tutte","year":"1947","journal-title":"J. Lond. Math. Soc."},{"issue":"2","key":"10.1016\/j.disc.2026.115251_br0180","doi-asserted-by":"crossref","first-page":"639","DOI":"10.2298\/FIL2502639W","article-title":"An A\u03b1-spectral radius for a spanning tree with constrained leaf distance in a graph","volume":"39","author":"Wang","year":"2025","journal-title":"Filomat"},{"issue":"5","key":"10.1016\/j.disc.2026.115251_br0190","doi-asserted-by":"crossref","first-page":"1385","DOI":"10.1007\/s11425-009-0192-6","article-title":"A conjecture on k-factor-critical and 3-\u03b3-critical graphs","volume":"53","author":"Wang","year":"2010","journal-title":"Sci. China, Math."},{"issue":"6","key":"10.1016\/j.disc.2026.115251_br0200","doi-asserted-by":"crossref","first-page":"1441","DOI":"10.1007\/s00010-024-01112-x","article-title":"Characterizing spanning trees via the size or the spectral radius of graphs","volume":"98","author":"Wu","year":"2024","journal-title":"Aequ. Math."},{"issue":"4","key":"10.1016\/j.disc.2026.115251_br0210","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/s40314-025-03478-3","article-title":"Some results on the k-strong parity property in a graph","volume":"45","author":"Wu","year":"2026","journal-title":"Comput. Appl. Math."},{"key":"10.1016\/j.disc.2026.115251_br0220","first-page":"55","article-title":"Characterizations of various matching extensions in graphs","volume":"7","author":"Yu","year":"1993","journal-title":"Australas. J. Comb."},{"key":"10.1016\/j.disc.2026.115251_br0230","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.dam.2024.01.045","article-title":"Some sufficient conditions for a graph with minimum degree to be k-factor-critical","volume":"348","author":"Zheng","year":"2024","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.disc.2026.115251_br0240","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1216\/rmj.2025.55.1185","article-title":"Regarding r-orthogonal factorizations in bipartite graphs","volume":"55","author":"Zhou","year":"2025","journal-title":"Rocky Mt. J. Math."},{"key":"10.1016\/j.disc.2026.115251_br0250","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.dam.2025.03.014","article-title":"Some spectral conditions for star-factors in bipartite graphs","volume":"369","author":"Zhou","year":"2025","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.disc.2026.115251_br0260","first-page":"601","article-title":"Toughness, fractional extendability and distance spectral radius in graphs","volume":"62","author":"Zhou","year":"2025","journal-title":"J. Korean Math. Soc."},{"key":"10.1016\/j.disc.2026.115251_br0270","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/j.dam.2026.02.015","article-title":"Spectral conditions for path-factors in isolated tough graphs","volume":"385","author":"Zhou","year":"2026","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2026.115251_br0280","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.laa.2022.12.018","article-title":"Two sufficient conditions for odd [1,b]-factors in graphs","volume":"661","author":"Zhou","year":"2023","journal-title":"Linear Algebra Appl."},{"issue":"20","key":"10.1016\/j.disc.2026.115251_br0290","doi-asserted-by":"crossref","first-page":"7235","DOI":"10.2298\/FIL2420235Z","article-title":"A new result on orthogonal factorizations in networks","volume":"38","author":"Zhou","year":"2024","journal-title":"Filomat"},{"issue":"3","key":"10.1016\/j.disc.2026.115251_br0300","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/s00010-024-01075-z","article-title":"Distance signless Laplacian spectral radius for the existence of path-factors in graphs","volume":"98","author":"Zhou","year":"2024","journal-title":"Aequ. Math."},{"issue":"3","key":"10.1016\/j.disc.2026.115251_br0310","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/s11227-024-06902-3","article-title":"Spectral radius and k-factor-critical graphs","volume":"81","author":"Zhou","year":"2025","journal-title":"J. Supercomput."},{"issue":"16","key":"10.1016\/j.disc.2026.115251_br0320","doi-asserted-by":"crossref","first-page":"23357","DOI":"10.1007\/s11227-024-06355-8","article-title":"Spanning k-trees and distance spectral radius in graphs","volume":"80","author":"Zhou","year":"2024","journal-title":"J. Supercomput."},{"issue":"3","key":"10.1016\/j.disc.2026.115251_br0330","doi-asserted-by":"crossref","first-page":"154","DOI":"10.55016\/ojs\/cdm.v19i3.72597","article-title":"Some results about star-factors in graphs","volume":"19","author":"Zhou","year":"2024","journal-title":"Contrib. Discrete Math."},{"issue":"2","key":"10.1016\/j.disc.2026.115251_br0340","doi-asserted-by":"crossref","first-page":"649","DOI":"10.2298\/FIL2502649Z","article-title":"Signless Laplacian spectral radius for a k-extendable graph","volume":"39","author":"Zhou","year":"2025","journal-title":"Filomat"},{"issue":"16","key":"10.1016\/j.disc.2026.115251_br0350","doi-asserted-by":"crossref","first-page":"5885","DOI":"10.2298\/FIL2416885Z","article-title":"Some properties of (a,b,k)-critical graphs","volume":"38","author":"Zhou","year":"2024","journal-title":"Filomat"},{"issue":"5","key":"10.1016\/j.disc.2026.115251_br0360","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.113940","article-title":"The A\u03b1-spectral radius for path-factors in graphs","volume":"347","author":"Zhou","year":"2024","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X2600275X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X2600275X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T16:56:20Z","timestamp":1780419380000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X2600275X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":36,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2026,11]]}},"alternative-id":["S0012365X2600275X"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115251","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Sufficient conditions for a graph with minimum degree to be k-critical with respect to an odd [1,b]-factor","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115251","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":"115251"}}