{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T05:40:53Z","timestamp":1781847653609,"version":"3.54.5"},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004608","name":"Jiangsu Province Natural Science Foundation","doi-asserted-by":"publisher","award":["BK20241949"],"award-info":[{"award-number":["BK20241949"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Shandong Province Natural Science Foundation","doi-asserted-by":"publisher","award":["ZR2023MA078"],"award-info":[{"award-number":["ZR2023MA078"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.dam.2026.03.018","type":"journal-article","created":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T12:04:01Z","timestamp":1773662641000},"page":"365-372","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Sufficient conditions for even factors in graphs"],"prefix":"10.1016","volume":"386","author":[{"given":"Sizhong","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiuxiang","family":"Bian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiancheng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.03.018_b1","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.dam.2025.01.004","article-title":"Spectral conditions of pancyclicity for t-tough graphs","volume":"365","author":"Benediktovich","year":"2025","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.018_b2","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2023.113436","article-title":"Local Dirac\u2019s condition on the existence of 2-factor","volume":"346","author":"Chen","year":"2023","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.dam.2026.03.018_b3","doi-asserted-by":"crossref","DOI":"10.37236\/12165","article-title":"Binding number, k-factor and spectral radius of graphs","volume":"31","author":"Fan","year":"2024","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.dam.2026.03.018_b4","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2022.112892","article-title":"Spectral radius and [a,b]-factors in graphs","volume":"345","author":"Fan","year":"2022","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.03.018_b5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0012-365X(92)90669-7","article-title":"An extremal problem for the spectral radius of a graph","volume":"108","author":"Fiedler","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.03.018_b6","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(92)90587-6","article-title":"Spanning Eulerian subgraphs, the splitting Lemma, and Petersen\u2019s theorem","volume":"101","author":"Fleischner","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.03.018_b7","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.dam.2022.07.022","article-title":"A note on eigenvalue, spectral radius and energy of extended adjacency matrix","volume":"322","author":"Ghorbani","year":"2022","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.018_b8","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/j.dam.2024.09.032","article-title":"Binding number, odd [1,b]-factors and the distance spectral radius","volume":"360","author":"Hua","year":"2025","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.018_b9","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.jctb.2008.05.001","article-title":"Even factors, jump systems, and discrete convexity","volume":"99","author":"Kobayashi","year":"2009","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.03.018_b10","first-page":"167","article-title":"On the largest eigenvalue of a graph","volume":"2","author":"Li","year":"1979","journal-title":"Acta Math. Appl. Sin."},{"key":"10.1016\/j.dam.2026.03.018_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2021.112588","article-title":"Characterizing P\u22652-factor and P\u22652-factor covered graphs with respect to the size or the spectral radius","volume":"344","author":"Li","year":"2021","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.03.018_b12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s11425-015-0506-3","article-title":"Even factors with a bounded number of components in iterated line graphs","volume":"60","author":"Lv","year":"2017","journal-title":"Sci. China Math."},{"key":"10.1016\/j.dam.2026.03.018_b13","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.dam.2024.01.001","article-title":"Matching extension and matching exclusion via the size or the spectral radius of graphs","volume":"347","author":"Miao","year":"2024","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.018_b14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/(SICI)1097-0118(199605)22:1<59::AID-JGT8>3.0.CO;2-K","article-title":"A degree condition for the existence of regular factors in K1,n-free graphs","volume":"22","author":"Ota","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.03.018_b15","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/(SICI)1097-0118(199910)32:2<109::AID-JGT1>3.0.CO;2-O","article-title":"Closure, 2-factors and cycle coverings in claw-free graphs","volume":"32","author":"Ryj\u00e1\u010dek","year":"1999","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.03.018_b16","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/s00373-022-02506-x","article-title":"Even factors in edge-chromatic-critical graphs with a small number of divalent vertices","volume":"38","author":"Steffen","year":"2022","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2026.03.018_b17","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":"Canad. J. Math."},{"issue":"13","key":"10.1016\/j.dam.2026.03.018_b18","doi-asserted-by":"crossref","first-page":"4579","DOI":"10.2298\/FIL2513579W","article-title":"Remarks on strong parity factors in graphs","volume":"39","author":"Wang","year":"2025","journal-title":"Filomat"},{"issue":"4","key":"10.1016\/j.dam.2026.03.018_b19","doi-asserted-by":"crossref","first-page":"359","DOI":"10.59277\/PRA-SER.A.26.4.04","article-title":"Spectral radius and path-factor critical graphs","volume":"26","author":"Wang","year":"2025","journal-title":"Proc. Rom. Acad. Ser. A Math. Phys. Tech. Sci. Inf. Sci."},{"issue":"6","key":"10.1016\/j.dam.2026.03.018_b20","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":"Aequationes Math."},{"issue":"4","key":"10.1016\/j.dam.2026.03.018_b21","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.dam.2026.03.018_b22","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.dam.2017.02.015","article-title":"Characterization of forbidden subgraphs for the existence of even factors in a graph","volume":"223","author":"Xiong","year":"2017","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.018_b23","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.7151\/dmgt.2158","article-title":"Strong Tutte type conditions and factors of graphs","volume":"40","author":"Yan","year":"2020","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2026.03.018_b24","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.laa.2019.04.013","article-title":"On the spectrum of an equitable quotient matrix and its application","volume":"577","author":"You","year":"2019","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.03.018_b25","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.114384","article-title":"Characterizing forbidden pairs for the existence of even factors","volume":"348","author":"Zhang","year":"2025","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.03.018_b26","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."},{"key":"10.1016\/j.dam.2026.03.018_b27","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.113975","article-title":"Spectral conditions for graphs having all (fractional) [a,b]-factors","volume":"347","author":"Zheng","year":"2024","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.dam.2026.03.018_b28","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 Mountain J. Math."},{"key":"10.1016\/j.dam.2026.03.018_b29","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.dam.2026.03.018_b30","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.dam.2026.03.018_b31","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."},{"issue":"5","key":"10.1016\/j.dam.2026.03.018_b32","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.113927","article-title":"D-Index and Q-index for spanning trees with leaf degree at most k in graphs","volume":"347","author":"Zhou","year":"2024","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.dam.2026.03.018_b33","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.dam.2026.03.018_b34","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":"8","key":"10.1016\/j.dam.2026.03.018_b35","doi-asserted-by":"crossref","first-page":"2711","DOI":"10.2298\/FIL2508711Z","article-title":"Sufficient conditions for fractional k-extendable graphs","volume":"39","author":"Zhou","year":"2025","journal-title":"Filomat"},{"issue":"5","key":"10.1016\/j.dam.2026.03.018_b36","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."},{"issue":"5","key":"10.1016\/j.dam.2026.03.018_b37","first-page":"1883","article-title":"Toughness and A\u03b1-spectral radius in graphs","volume":"40","author":"Zhou","year":"2026","journal-title":"Filomat"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001605?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001605?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T04:01:09Z","timestamp":1776139269000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26001605"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":37,"alternative-id":["S0166218X26001605"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.018","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Sufficient conditions for even factors in graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.018","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"}]}}