{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T14:16:50Z","timestamp":1785161810425,"version":"3.55.0"},"reference-count":24,"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\/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,11]]},"DOI":"10.1016\/j.disc.2026.115278","type":"journal-article","created":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T10:21:30Z","timestamp":1782382890000},"page":"115278","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["2-factor with at most two components under a degree sum condition"],"prefix":"10.1016","volume":"349","author":[{"given":"Hongli","family":"Liao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3091-3252","authenticated-orcid":false,"given":"Liming","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2026.115278_br0010","series-title":"Graph Theory","author":"Bondy","year":"2008"},{"key":"10.1016\/j.disc.2026.115278_br0020","first-page":"233","article-title":"Super-Eulerian graphs, collapsible graphs, and four-cycles","volume":"58","author":"Catlin","year":"1987","journal-title":"Congr. Numer."},{"issue":"1","key":"10.1016\/j.disc.2026.115278_br0030","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/jgt.3190120105","article-title":"A reduction method to find spanning Eulerian subgraphs","volume":"12","author":"Catlin","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115278_br0040","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1002\/jgt.3190150304","article-title":"Regular factors in K1,3-free graphs","volume":"15","author":"Choudum","year":"1991","journal-title":"J. Graph Theory"},{"issue":"2","key":"10.1016\/j.disc.2026.115278_br0050","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(72)90079-9","article-title":"A note on Hamiltonian circuits","volume":"2","author":"Chv\u00e1tal","year":"1972","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.disc.2026.115278_br0060","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","article-title":"Some theorems on abstract graphs","volume":"s3\u20132","author":"Dirac","year":"1952","journal-title":"Proc. Lond. Math. Soc."},{"issue":"3","key":"10.1016\/j.disc.2026.115278_br0070","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/jgt.3190150310","article-title":"Regular factors in K1,n free graphs","volume":"15","author":"Egawa","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115278_br0080","doi-asserted-by":"crossref","first-page":"1571","DOI":"10.1016\/j.disc.2007.04.014","article-title":"Forbidden subgraphs that imply 2-factors","volume":"308","author":"Faudree","year":"2008","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"10.1016\/j.disc.2026.115278_br0090","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.disc.2005.06.005","article-title":"A note on 2-factors with two components","volume":"300","author":"Faudree","year":"2005","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.disc.2026.115278_br0100","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(92)90587-6","article-title":"Spanning eularian subgraphs, the splitting lemma, and Petersen's theorem","volume":"101","author":"Fleischner","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115278_br0110","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF02022560","article-title":"On factorisation of graphs","volume":"1","author":"Gallai","year":"1950","journal-title":"Acta Math. Acad. Sci. Hung."},{"issue":"1\u20133","key":"10.1016\/j.disc.2026.115278_br0120","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0012-365X(00)00317-4","article-title":"Two-factors with few cycles in claw-free graphs","volume":"231","author":"Gould","year":"2001","journal-title":"Discrete Math."},{"issue":"6","key":"10.1016\/j.disc.2026.115278_br0130","doi-asserted-by":"crossref","first-page":"701","DOI":"10.4153\/CMB-1965-051-3","article-title":"On Eulerian and Hamiltonian graphs and line graphs","volume":"8","author":"Harary","year":"1965","journal-title":"Can. Math. Bull."},{"issue":"22","key":"10.1016\/j.disc.2026.115278_br0140","doi-asserted-by":"crossref","first-page":"2775","DOI":"10.1016\/j.disc.2006.11.023","article-title":"Even subgraphs of bridgeless graphs and 2-factors of line graphs","volume":"307","author":"Jackson","year":"2007","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.disc.2026.115278_br0150","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/jgt.10119","article-title":"A 2-factor with two components of a graph satisfying the Chv\u00e1tal-Erd\u00f6s condition","volume":"43","author":"Kaneko","year":"2003","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115278_br0160","first-page":"269","article-title":"Even factor of a graph with a bounded number of components","volume":"48","author":"Niu","year":"2010","journal-title":"Australas. J. Comb."},{"key":"10.1016\/j.disc.2026.115278_br0170","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/j.disc.2005.11.059","article-title":"Graph factors and factorization: 1985-2003: a survey","volume":"307","author":"Plummer","year":"2007","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115278_br0180","series-title":"Claw-free Graphs and Line Graphs","author":"Shao","year":"2005"},{"key":"10.1016\/j.disc.2026.115278_br0190","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","article-title":"The factorization of linear graphs","author":"Tutte","year":"1947","journal-title":"J. Lond. Math. Soc. (2)"},{"issue":"1","key":"10.1016\/j.disc.2026.115278_br0200","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(92)00063-W","article-title":"On dominating and spanning circuits in graphs","volume":"124","author":"Veldman","year":"1994","journal-title":"Discrete Math."},{"issue":"12","key":"10.1016\/j.disc.2026.115278_br0210","doi-asserted-by":"crossref","first-page":"3779","DOI":"10.1016\/j.disc.2008.10.012","article-title":"Traceability of line graphs","volume":"309","author":"Xiong","year":"2009","journal-title":"Discrete Math."},{"issue":"8","key":"10.1016\/j.disc.2026.115278_br0220","doi-asserted-by":"crossref","first-page":"2417","DOI":"10.1016\/j.disc.2008.05.020","article-title":"The structure of even factors in claw-free graphs","volume":"309","author":"Xiong","year":"2009","journal-title":"Discrete Math."},{"issue":"22","key":"10.1016\/j.disc.2026.115278_br0230","doi-asserted-by":"crossref","first-page":"2808","DOI":"10.1016\/j.disc.2006.11.022","article-title":"On the number of components in 2-factors of claw-free graphs","volume":"307","author":"Yoshimoto","year":"2007","journal-title":"Discrete Math."},{"issue":"5","key":"10.1016\/j.disc.2026.115278_br0240","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/s00373-025-02947-0","article-title":"Every 3-connected claw-free graph of diameter at most 3 has a 2-factor with at most two components","volume":"41","author":"Zhang","year":"2025","journal-title":"Graphs Comb."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X2600302X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X2600302X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T13:36:55Z","timestamp":1785159415000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X2600302X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":24,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2026,11]]}},"alternative-id":["S0012365X2600302X"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115278","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":"2-factor with at most two components under a degree sum condition","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115278","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":"115278"}}