{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T14:35:46Z","timestamp":1696343746710},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2009,11,1]],"date-time":"2009-11-01T00:00:00Z","timestamp":1257033600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s00373-010-0878-0","type":"journal-article","created":{"date-parts":[[2010,2,5]],"date-time":"2010-02-05T04:20:46Z","timestamp":1265343646000},"page":"717-726","source":"Crossref","is-referenced-by-count":4,"title":["Elementary Graphs with Respect to f-Parity Factors"],"prefix":"10.1007","volume":"25","author":[{"given":"Mikio","family":"Kano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gyula Y.","family":"Katona","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1cint","family":"Szab\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,6]]},"reference":[{"key":"878_CR1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02582935","volume":"1","author":"A. Amahashi","year":"1985","unstructured":"Amahashi A.: On factors with all degrees odd. Graphs Combin. 1, 111\u2013114 (1985)","journal-title":"Graphs Combin."},{"key":"878_CR2","doi-asserted-by":"crossref","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":"878_CR3","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1002\/jgt.3190120305","volume":"12","author":"Y. Cui","year":"1988","unstructured":"Cui Y., Kano M.: Some results on odd factors of graphs. J. Graph Theory 12, 327\u2013333 (1988)","journal-title":"J. Graph Theory"},{"key":"878_CR4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds J.: Paths, trees, and flowers. Can. J. Math. 17, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"key":"878_CR5","first-page":"135","volume":"8","author":"T. Gallai","year":"1963","unstructured":"Gallai T.: Kritische Graphen II. A Magyar Tud. Akad. Mat. Kut. Int. K\u00f6zl. 8, 135\u2013139 (1963)","journal-title":"A Magyar Tud. Akad. Mat. Kut. Int. K\u00f6zl."},{"key":"878_CR6","first-page":"401","volume":"9","author":"T. Gallai","year":"1964","unstructured":"Gallai T.: Maximale Systeme unabh\u00e4ngiger Kanten. A Magyar Tud. Akad. Mat. Kut. Int. K\u00f6zl. 9, 401\u2013413 (1964)","journal-title":"A Magyar Tud. Akad. Mat. Kut. Int. K\u00f6zl."},{"key":"878_CR7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0012-365X(01)00424-1","volume":"250","author":"M. Kano","year":"2002","unstructured":"Kano M., Katona G.Y.: Odd subgraphs and matchings. Discrete Math. 250, 265\u2013272 (2002)","journal-title":"Discrete Math."},{"key":"878_CR8","doi-asserted-by":"crossref","first-page":"1404","DOI":"10.1016\/j.disc.2005.11.078","volume":"307","author":"M. Kano","year":"2007","unstructured":"Kano M., Katona G.Y.: Structure theorem and algorithm on (1, f)-odd subgraphs. Discrete Math. 307, 1404\u20131417 (2007)","journal-title":"Discrete Math."},{"key":"878_CR9","unstructured":"Kir\u00e1ly, Z.: The calculus of barriers (to appear)"},{"key":"878_CR10","unstructured":"Lov\u00e1sz, L.: The factorization of graphs, Combinatorial Structures and their Applications. In: Proc. Calgary Internat. Conf., Calgary, Alta., 1969, pp. 243\u2013246 (1970)"},{"key":"878_CR11","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01889914","volume":"23","author":"L. Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz L.: On the structure of factorizable graphs. Acta Math. Acad. Sci. Hungar. 23, 179\u2013195 (1972)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"878_CR12","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01889919","volume":"23","author":"L. Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz L.: The factorization of graphs, II. Acta Math. Acad. Sci. Hungar. 23, 223\u2013246 (1972)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"878_CR13","volume-title":"Matching Theory. North-Holland Mathematics Studies","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz L., Plummer M.D.: Matching Theory. North-Holland Mathematics Studies. North-Holland Publishing Co., Amsterdam (1986)"},{"key":"878_CR14","unstructured":"Szab\u00f3, J.: A note on the degree prescribed factor problem, EGRES Technical Reports 2004-19. http:\/\/www.cs.elte.hu\/egres"},{"key":"878_CR15","unstructured":"Szab\u00f3, J.: Graph packings and the degree prescribed subgraph problem. PhD thesis, E\u00f6tv\u00f6s University, Budapest (2006)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0878-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0878-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0878-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:29Z","timestamp":1559041109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0878-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["878"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0878-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11]]}}}