{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:17Z","timestamp":1740107117940,"version":"3.37.3"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s00373-023-02658-4","type":"journal-article","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T02:02:46Z","timestamp":1685671366000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Forbidden Pairs for Connected Even Factors in Supereulerian Graphs"],"prefix":"10.1007","volume":"39","author":[{"given":"Panpan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liming","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"2658_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, London (2008)"},{"issue":"8","key":"2658_CR2","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1016\/j.disc.2015.02.022","volume":"338","author":"M Hasanvand","year":"2015","unstructured":"Hasanvand, M.: Spanning trees and spanning Eulerian subgraphs with small degrees. Discrete Math. 338(8), 1317\u20131321 (2015)","journal-title":"Discrete Math."},{"key":"2658_CR3","first-page":"385","volume":"115","author":"F Duan","year":"2014","unstructured":"Duan, F., Zhang, W.J., Wang, G.P.: Connected even factors in $$\\{K_{1, l}, K_{1, l}+e\\}$$-free graphs. Ars Comb. 115, 385\u2013389 (2014)","journal-title":"Ars Comb."},{"key":"2658_CR4","doi-asserted-by":"publisher","first-page":"2282","DOI":"10.1016\/j.disc.2007.04.058","volume":"308","author":"MC Li","year":"2008","unstructured":"Li, M.C., Xiong, L.M., Broersma, H.J.: Connected even factors in claw-free graphs. Discrete Math. 308, 2282\u20132284 (2008)","journal-title":"Discrete Math."},{"key":"2658_CR5","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.dam.2020.08.034","volume":"288","author":"XJ Yang","year":"2021","unstructured":"Yang, X.J., Du, J.F., Xiong, L.M.: Forbidden subgraphs for supereulerian and Hamiltonian graphs. Discrete Appl. Math. 288, 192\u2013200 (2021)","journal-title":"Discrete Appl. Math."},{"key":"2658_CR6","first-page":"106","volume":"79","author":"K Kotani","year":"2021","unstructured":"Kotani, K., Nishida, S.: Existence of 3-factors in $$k_{1, n}$$-free graphs with connectivity and edge-connectivity conditions. Australas. J. Comb. 79, 106\u2013122 (2021)","journal-title":"Australas. J. Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02658-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02658-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02658-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T11:31:09Z","timestamp":1691667069000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02658-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["2658"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02658-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"23 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"64"}}