{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T11:40:38Z","timestamp":1649158838801},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T00:00:00Z","timestamp":1207008000000},"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":[[2008,4]]},"DOI":"10.1007\/s00373-008-0776-x","type":"journal-article","created":{"date-parts":[[2008,5,14]],"date-time":"2008-05-14T13:59:19Z","timestamp":1210773559000},"page":"71-80","source":"Crossref","is-referenced-by-count":1,"title":["A 2-factor with Short Cycles Passing Through Specified Independent Vertices in Graph"],"prefix":"10.1007","volume":"24","author":[{"given":"Jiuying","family":"Dong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,15]]},"reference":[{"key":"776_CR1","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s B.: Extremal Graph Theory. Academic Press. London (1978)","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"776_CR2","doi-asserted-by":"crossref","unstructured":"Brandt, S., Chen, G., Faudree, R., R. Gould, J., Lesniak, L.: Degree conditions for 2-factors. J. Graph Theory 24, 165\u2013173 (1997)","DOI":"10.1002\/(SICI)1097-0118(199702)24:2<165::AID-JGT4>3.0.CO;2-O"},{"key":"776_CR3","doi-asserted-by":"crossref","unstructured":"Egawa, Y., Enomoto , H., Faudree, R., Li, H., schiermeyer, I.: Two-Factors Each Component of Which Contains a Specified Vertex. J. Graph Theory 43, 188\u2013198 (2003)","DOI":"10.1002\/jgt.10113"},{"key":"776_CR4","doi-asserted-by":"crossref","unstructured":"Egawa, Y., Hagita, M., Kawarabayashi, K., Wang, H.: Covering vertices of a graph by k disjoint cycles. Discrete Math. 270, 115\u2013125 (2003)","DOI":"10.1016\/S0012-365X(02)00831-2"},{"key":"776_CR5","doi-asserted-by":"crossref","unstructured":"Egawa, Y., Fujita, S., Kawarabayashi, K., Wang, H.: Existence of two disjoint long cycles in graph. Discrete Math. 305, 154\u2013169 (2005)","DOI":"10.1016\/j.disc.2005.10.017"},{"key":"776_CR6","doi-asserted-by":"crossref","unstructured":"Egawa, Y., Faudree, R., Gy\u00f6ri, E., Ishigami, Y., Schelp, R., Wang, H.: Vertex-disjoint cycles containing specified edges. Graphs and Combin. 16, 81\u201392 (2000)","DOI":"10.1007\/s003730050005"},{"key":"776_CR7","doi-asserted-by":"crossref","unstructured":"Faudree, R., Gould, R., Jacobson, M., Lesniak, L., Saito, A.: A note on 2-factors with two components. Discrete Math. 300, 218\u2013224 (2005)","DOI":"10.1016\/j.disc.2005.06.005"},{"key":"776_CR8","doi-asserted-by":"crossref","unstructured":"Ishigami Y.: Vertex-Disjoint Cycles of Length at Most Four Each of Which Contains a Specified Vertex. J. Graph Theory 37, 37\u201347 (2001)","DOI":"10.1002\/jgt.1002"},{"key":"776_CR9","doi-asserted-by":"crossref","unstructured":"Matsumura H.: Vertex-disjoint 4-cycles containing specified edges in a bipartite graph. Discrete Math. 297, 78\u201390 (2005)","DOI":"10.1016\/j.disc.2005.03.011"},{"key":"776_CR10","doi-asserted-by":"crossref","unstructured":"Ore O.: Note on hamiltonian circuits. Amer. Math Monthly 67, 55 (1960)","DOI":"10.2307\/2308928"},{"key":"776_CR11","doi-asserted-by":"crossref","unstructured":"Wang H.: On the maximum number of independent cycles in a graph. Discrete Math. 205, 183\u2013190 (1999)","DOI":"10.1016\/S0012-365X(99)00009-6"},{"key":"776_CR12","doi-asserted-by":"crossref","unstructured":"Wang H.: Covering a graph with cycles passing through given edges. J. Graph Theory 26, 105\u2013109 (1997)","DOI":"10.1002\/(SICI)1097-0118(199710)26:2<105::AID-JGT5>3.0.CO;2-W"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0776-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0776-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0776-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:28Z","timestamp":1559041108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0776-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["776"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0776-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4]]}}}