{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:22:10Z","timestamp":1649190130304},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,4,1]],"date-time":"2007-04-01T00:00:00Z","timestamp":1175385600000},"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":[[2007,4]]},"DOI":"10.1007\/s00373-006-0678-8","type":"journal-article","created":{"date-parts":[[2007,4,18]],"date-time":"2007-04-18T07:06:11Z","timestamp":1176879971000},"page":"135-143","source":"Crossref","is-referenced-by-count":1,"title":["Coverings of the Vertices of a Graph by Small Cycles"],"prefix":"10.1007","volume":"23","author":[{"given":"David","family":"Forge","sequence":"first","affiliation":[]},{"given":"Mekkia","family":"Kouider","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"678_CR1","unstructured":"Berge, C.: Graphes, Dunod (1987), p. 400"},{"key":"678_CR2","unstructured":"Dirac, G. A.: Some theorems on abstract graphs, Proc. London Math. Soc., 2, 69\u201381 (1952)"},{"key":"678_CR3","unstructured":"Enomoto, H., Kaneko, A., Tuza, Zs.: P3-factors and covering cycles in graphs of minimum degree n\/3. Combinatorics (Eger, 1987), 213\u2013220, Colloq. Math. Soc. Jdfnos Bolyai, 52, North-Holland, Amsterdam, 1988"},{"key":"678_CR4","doi-asserted-by":"crossref","unstructured":"Jackson, B.: Neighborhood Unions and Hamilton cycles, J. Graph Theory, 15, 443\u2013451 (1991)","DOI":"10.1002\/jgt.3190150409"},{"key":"678_CR5","unstructured":"Kouider, M., Lonc, Z.: Covering cycles and k-terms degree sums, Combinatorica, 16, 407\u2013412 (1996)"},{"key":"678_CR6","doi-asserted-by":"crossref","unstructured":"Kouider, M.: Neighborhoods and covering vertices by cycles, Combinatorica, 20(2), 219\u2013226 (2000)","DOI":"10.1007\/s004930070021"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0678-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-006-0678-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0678-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:26Z","timestamp":1559041106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-006-0678-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,4]]}},"alternative-id":["678"],"URL":"https:\/\/doi.org\/10.1007\/s00373-006-0678-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,4]]}}}