{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:07:50Z","timestamp":1649182070607},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"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":[[1986,12]]},"DOI":"10.1007\/bf01788078","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T11:37:00Z","timestamp":1119181020000},"page":"61-66","source":"Crossref","is-referenced-by-count":3,"title":["A note onf-factors in directed and undirected multigraphs"],"prefix":"10.1007","volume":"2","author":[{"given":"Pierre","family":"Fraisse","sequence":"first","affiliation":[]},{"given":"Pavol","family":"Hell","sequence":"additional","affiliation":[]},{"given":"David G.","family":"Kirkpatrick","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01788078_CR1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0012-365X(84)90030-X","volume":"50","author":"J.C. Bermond","year":"1984","unstructured":"Bermond, J.C., Las Vergnas, M.: Regular factors in nearly regular graphs. Discrete Math.50, 9\u201313 (1984)","journal-title":"Discrete Math."},{"key":"BF01788078_CR2","unstructured":"Katerinis, P.: Personal communication"},{"key":"BF01788078_CR3","unstructured":"Katerinis, P.: Some results on the existence of 2n-factors in terms of vertex-deleted subgraphs (personal communication)"},{"key":"BF01788078_CR4","unstructured":"Katernis, P.: J. Graph Theory (to appear)"},{"key":"BF01788078_CR5","first-page":"7","volume-title":"Combinatorial Problems and Exercises","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: Combinatorial Problems and Exercises, 7\u201316. Amsterdam: North-Holland 1979"},{"key":"BF01788078_CR6","doi-asserted-by":"crossref","first-page":"44","DOI":"10.4153\/CJM-1950-005-2","volume":"1","author":"W.T. Tutte","year":"1950","unstructured":"Tutte, W.T.: The factors of graphs. Canad. J. Math.1, 44\u201349 (1950)","journal-title":"Canad. J. Math."},{"key":"BF01788078_CR7","first-page":"34","volume":"6","author":"W.T. Tutte","year":"1954","unstructured":"Tutte, W.T.: A short proof of the factor theorem for finite graphs. Canad. J. Math.6, 34 (1954)","journal-title":"Canad. J. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788078.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01788078\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T13:12:22Z","timestamp":1557493942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01788078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["BF01788078"],"URL":"https:\/\/doi.org\/10.1007\/bf01788078","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,12]]}}}