{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T09:17:14Z","timestamp":1766049434350,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T00:00:00Z","timestamp":1598313600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T00:00:00Z","timestamp":1598313600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004329","name":"Slovenian Research Agency","doi-asserted-by":"crossref","award":["N1-0108"],"award-info":[{"award-number":["N1-0108"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100005357","name":"Slovak Research and Development Agency","doi-asserted-by":"crossref","award":["APVV-19-0153"],"award-info":[{"award-number":["APVV-19-0153"]}],"id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100011019","name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal","doi-asserted-by":"publisher","award":["SNN 129364"],"award-info":[{"award-number":["SNN 129364"]}],"id":[{"id":"10.13039\/501100011019","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>It is well known that if <jats:inline-formula><jats:alternatives><jats:tex-math>$$G = (V, E)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n<mml:mrow>\n<mml:mi>G<\/mml:mi>\n<mml:mo>=<\/mml:mo>\n<mml:mo>(<\/mml:mo>\n<mml:mi>V<\/mml:mi>\n<mml:mo>,<\/mml:mo>\n<mml:mi>E<\/mml:mi>\n<mml:mo>)<\/mml:mo>\n<\/mml:mrow>\n<\/mml:math><\/jats:alternatives><\/jats:inline-formula> is a connected multigraph and <jats:inline-formula><jats:alternatives><jats:tex-math>$$X\\subset V$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n<mml:mrow>\n<mml:mi>X<\/mml:mi>\n<mml:mo>\u2282<\/mml:mo>\n<mml:mi>V<\/mml:mi>\n<\/mml:mrow>\n<\/mml:math><\/jats:alternatives><\/jats:inline-formula> is a subset of even order, then <jats:italic>G<\/jats:italic> contains a spanning forest <jats:italic>H<\/jats:italic> such that each vertex from <jats:italic>X<\/jats:italic> has an odd degree in <jats:italic>H<\/jats:italic> and all the other vertices have an even degree in <jats:italic>H<\/jats:italic>. This spanning forest may have isolated vertices. If this is not allowed in <jats:italic>H<\/jats:italic>, then the situation is much more complicated. In this paper, we study this problem and generalize the concepts of even-factors and odd-factors in a unified form.<\/jats:p>","DOI":"10.1007\/s00373-020-02225-1","type":"journal-article","created":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T21:03:22Z","timestamp":1598389402000},"page":"1391-1399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["On Specific Factors in Graphs"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0511-5291","authenticated-orcid":false,"given":"Csilla","family":"Bujt\u00e1s","sequence":"first","affiliation":[]},{"given":"Stanislav","family":"Jendrol\u2019","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3235-9221","authenticated-orcid":false,"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,25]]},"reference":[{"key":"2225_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.3190090103","volume":"9","author":"J Akiyama","year":"1985","unstructured":"Akiyama, J., Kano, M.: Factors and factorizations of graphs\u2014a survey. J. Graph Theory 9, 1\u201342 (1985)","journal-title":"J. Graph Theory"},{"key":"2225_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21919-1","volume-title":"Factors and Factorizations of Graphs. Lecture Notes in Mathematics","author":"J Akiyama","year":"2011","unstructured":"Akiyama, J., Kano, M.: Factors and Factorizations of Graphs. Lecture Notes in Mathematics. Springer, Berlin (2011)"},{"key":"2225_CR3","first-page":"103","volume-title":"Recent Results in Decompositions. London Mathematical Society Lecture Note Series","author":"F Chung","year":"1981","unstructured":"Chung, F., Graham, R.: Recent Results in Decompositions. London Mathematical Society Lecture Note Series, pp. 103\u2013123. Cambridge University Press, Cambridge (1981)"},{"key":"2225_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0095-8956(88)90068-8","volume":"45","author":"G Cornu\u00e9jols","year":"1988","unstructured":"Cornu\u00e9jols, G.: General factors of graphs. J. Combin. Theory Ser. B 45, 185\u2013198 (1988)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2225_CR5","unstructured":"Frank, A.: A survey on $$T$$-joins, $$T$$-cuts, and conservative weightings. In: Mikl\u00f3s, D., S\u00f3s, V.T., Sz\u0151nyi, T. (eds.) Combinatorics, Paul Erd\u0151s is Eighty, vol.\u00a02. Bolyai Society Mathematical Studies, vol. 2, pp. 213\u2013252. J. Bolyai Math. Soc., Budapest (1996)"},{"key":"2225_CR6","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, 1317\u20131321 (2015)","journal-title":"Discrete Math."},{"key":"2225_CR7","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/S0021-9800(70)80033-3","volume":"8","author":"L Lov\u00e1sz","year":"1970","unstructured":"Lov\u00e1sz, L.: Subgraphs with prescribed valencies. J. Combin. Theory 8, 391\u2013416 (1970)","journal-title":"J. Combin. Theory"},{"key":"2225_CR8","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. Akad\u00e9miai Kiad\u00f3, Budapest; Annals of Discrete Mathematics, vol.\u00a029, North-Holland Mathematics Studies, vol.\u00a0121. Elsevier Sci. Publ., Amsterdam (1986)"},{"key":"2225_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-010-0973-2","volume":"27","author":"K Ozeki","year":"2011","unstructured":"Ozeki, K., Yamashita, T.: Spanning trees: a survey. Graphs Combin. 27, 1\u201326 (2011)","journal-title":"Graphs Combin."},{"key":"2225_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Petersen","year":"1891","unstructured":"Petersen, J.: Die Theorie der regul\u00e4ren Graphen. Acta Math. 15, 193\u2013220 (1891)","journal-title":"Acta Math."},{"key":"2225_CR11","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.disc.2005.11.059","volume":"307","author":"MD Plummer","year":"2007","unstructured":"Plummer, M.D.: Graphs factors and factorization: 1985\u20132003: a survey. Discrete Math. 307, 791\u2013821 (2007)","journal-title":"Discrete Math."},{"key":"2225_CR12","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1002\/jgt.20311","volume":"58","author":"C Thomassen","year":"2008","unstructured":"Thomassen, C.: Decomposition of highly connected graphs into paths of length 3. J. Graph Theory 58, 286\u2013292 (2008)","journal-title":"J. Graph Theory"},{"key":"2225_CR13","first-page":"19","volume":"97","author":"L Volkmann","year":"1995","unstructured":"Volkmann, L.: Regular graphs, regular factors, and the impact of Petersen\u2019s theorems. Jahresber. Deutsch. Math.-Verein. 97, 19\u201342 (1995)","journal-title":"Jahresber. Deutsch. Math.-Verein."},{"key":"2225_CR14","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2001)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02225-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02225-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02225-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T23:36:51Z","timestamp":1629848211000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02225-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,25]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["2225"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02225-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,8,25]]},"assertion":[{"value":"22 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}