{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:04:57Z","timestamp":1740107097798,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T00:00:00Z","timestamp":1604016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T00:00:00Z","timestamp":1604016000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11871439 and 11971439"],"award-info":[{"award-number":["11871439 and 11971439"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSF","award":["DMS1600592"],"award-info":[{"award-number":["DMS1600592"]}]},{"name":"Russian Foundation for Basic Research","award":["18-01-00353A and 19-01-00682"],"award-info":[{"award-number":["18-01-00353A and 19-01-00682"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s00373-020-02242-0","type":"journal-article","created":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T16:06:53Z","timestamp":1604074013000},"page":"199-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cut-Edges and Regular Factors in Regular Graphs of Odd Degree"],"prefix":"10.1007","volume":"37","author":[{"given":"Alexandr V.","family":"Kostochka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Raspaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bjarne","family":"Toft","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas B.","family":"West","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dara","family":"Zirlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,30]]},"reference":[{"key":"2242_CR1","doi-asserted-by":"crossref","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":"2242_CR2","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Kano, M.: Factors and factorizations of graphs: proof techniques in factor theory. Lecture Notes in Mathematics, vol. 2031. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-21919-1_5"},{"key":"2242_CR3","doi-asserted-by":"crossref","unstructured":"Baebler, F.: \u00dcber die Zerlegung regul\u00e4rer Streckenkromplexe ungerader Ordnung (German). Comment. Math. Helv. 10, 275\u2013287 (1937\u20131938)","DOI":"10.1007\/BF01214296"},{"key":"2242_CR4","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1515\/crll.1950.188.228","volume":"188","author":"H-B Belck","year":"1950","unstructured":"Belck, H.-B.: Regul\u00e4re Faktoren von Graphen (German). J. Reine Angew. Math. 188, 228\u2013252 (1950)","journal-title":"J. Reine Angew. Math."},{"key":"2242_CR5","unstructured":"Berge, C.: Graphs and hypergraphs (North-Holland, 1973): (translation and revision of Graphes et Hypergraphes, Dunod, 1970), p. 162 (1973)"},{"key":"2242_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/jgt.3190090107","volume":"9","author":"B Bollob\u00e1s","year":"1985","unstructured":"Bollob\u00e1s, B., Saito, A., Wormald, N.C.: Regular factors of regular graphs. J. Graph Theory 9, 97\u2013103 (1985)","journal-title":"J. Graph Theory"},{"key":"2242_CR7","unstructured":"H\u00e4ggkvist, R.: Factors galore: extending theorems of Petersen, Baebler, Belck and Gallai, lecture at \u201cCombinatorics in Cambridge\u201d, August 4, 2003 (2003)"},{"key":"2242_CR8","first-page":"23","volume":"50","author":"D Hanson","year":"1998","unstructured":"Hanson, D., Loten, C.O.M., Toft, B.: On interval colourings of bi-regular bipartite graphs. ARS Combin. 50, 23\u201332 (1998)","journal-title":"ARS Combin."},{"key":"2242_CR9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/jgt.3190110109","volume":"11","author":"P Katerinis","year":"1987","unstructured":"Katerinis, P.: Maximum matchings in a regular graph of specified connectivity and bounded order. J. Graph Theory 11, 53\u201358 (1987)","journal-title":"J. Graph Theory"},{"key":"2242_CR10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0012-365X(97)00166-0","volume":"185","author":"T Niessen","year":"1998","unstructured":"Niessen, T., Randerath, B.: Regular factors of simple regular graphs and factor-spectra. Discrete Math. 185, 89\u2013103 (1998)","journal-title":"Discrete Math."},{"key":"2242_CR11","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Petersen","year":"1891","unstructured":"Petersen, J.: Die Theorie der regul\u00e4ren graphs. Acta Math. 15, 193\u2013220 (1891)","journal-title":"Acta Math."},{"key":"2242_CR12","first-page":"310","volume":"22","author":"J Plesn\u00edk","year":"1972","unstructured":"Plesn\u00edk, J.: Connectivity of regular graphs and the existence of 1-factors. Mat. Casopis Sloven. Akad. Vied 22, 310\u2013318 (1972)","journal-title":"Mat. Casopis Sloven. Akad. Vied"},{"key":"2242_CR13","first-page":"51","volume":"7","author":"T Sch\u00f6nberger","year":"1934","unstructured":"Sch\u00f6nberger, T.: Ein Beweis des Petersenschen Graphensatzes. Acta Sci. Math. Szeged 7, 51\u201357 (1934)","journal-title":"Acta Sci. Math. Szeged"},{"key":"2242_CR14","doi-asserted-by":"crossref","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"WT Tutte","year":"1952","unstructured":"Tutte, W.T.: The factors of graphs. Can. J. Math. 4, 314\u2013328 (1952)","journal-title":"Can. J. Math."},{"key":"2242_CR15","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","volume":"6","author":"WT Tutte","year":"1954","unstructured":"Tutte, W.T.: A short proof of the factor theorem for finite graphs. Can. J. Math. 6, 347\u2013352 (1954)","journal-title":"Can. J. Math."},{"key":"2242_CR16","first-page":"1019","volume":"31","author":"L Xiao","year":"2007","unstructured":"Xiao, L., Liu, Y.: Even regular factor of regular graphs and number of cut edges. Southeast Asian Bull. Math. 31, 1019\u20131026 (2007)","journal-title":"Southeast Asian Bull. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02242-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-020-02242-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02242-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T21:37:47Z","timestamp":1669412267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-020-02242-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,30]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["2242"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02242-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,10,30]]},"assertion":[{"value":"3 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}