{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:06:44Z","timestamp":1758823604073,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,6,6]],"date-time":"2017-06-06T00:00:00Z","timestamp":1496707200000},"content-version":"unspecified","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":"publisher","award":["11271230","11671232"],"award-info":[{"award-number":["11271230","11671232"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s00373-017-1818-z","type":"journal-article","created":{"date-parts":[[2017,6,6]],"date-time":"2017-06-06T00:48:04Z","timestamp":1496710084000},"page":"955-967","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Partial Degree Conditions and Cycle Coverings in Bipartite Graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Suyun","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,6]]},"reference":[{"key":"1818_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0012-365X(00)00425-8","volume":"236","author":"MEK Abderrezzak","year":"2001","unstructured":"Abderrezzak, M.E.K., Flandrin, E., Amar, D.: Cyclability and pancyclability in bipartite graphs. Discr. Math. 236, 3\u201311 (2001)","journal-title":"Discr. Math."},{"key":"1818_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01303200","volume":"13","author":"B Bollob\u00e1s","year":"1993","unstructured":"Bollob\u00e1s, B., Brightwell, G.: Cycles through specified vertices. Combinatorica 13, 147\u2013155 (1993)","journal-title":"Combinatorica"},{"key":"1818_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. North-Holland, Amsterdam (1976)"},{"key":"1818_CR4","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.dam.2013.08.026","volume":"162","author":"J Cai","year":"2014","unstructured":"Cai, J., Li, H.: A new sufficient condition for pancyclability of graphs. Discr. Appl. Math. 162, 142\u2013148 (2014)","journal-title":"Discr. Appl. Math."},{"key":"1818_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/jgt.10159","volume":"46","author":"G Chen","year":"2004","unstructured":"Chen, G., Enomoto, H., Kawarabayashi, K., Lou, D., Ota, K., Saito, A.: Vertex-disjoint cycles containing specified vertices in a bipartite graph. J. Graph Theory 46, 145\u2013166 (2004)","journal-title":"J. Graph Theory"},{"key":"1818_CR6","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF01895727","volume":"14","author":"K Corr\u00e1di","year":"1963","unstructured":"Corr\u00e1di, K., Hajnal, A.: On the maximal number of independent circuits in a graph. Acta Math. Acad. Sci. Hungar. 14, 423\u2013439 (1963)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"issue":"3","key":"1818_CR7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"GA Dirac","year":"1952","unstructured":"Dirac, G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2(3), 69\u201381 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"1818_CR8","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s004930050034","volume":"18","author":"H Enomoto","year":"1998","unstructured":"Enomoto, H.: On the existence of disjoint cycles in a graph. Combinatorica 18, 487\u2013492 (1998)","journal-title":"Combinatorica"},{"key":"1818_CR9","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s12190-008-0202-9","volume":"31","author":"Y Gao","year":"2009","unstructured":"Gao, Y., Yan, J., Li, G.: On 2-factors with cycles containing specified vertices in a bipartite graph. J. Appl. Math. Comput. 31, 203\u2013215 (2009)","journal-title":"J. Appl. Math. Comput."},{"key":"1818_CR10","doi-asserted-by":"crossref","first-page":"6299","DOI":"10.1016\/j.disc.2008.04.017","volume":"309","author":"RJ Gould","year":"2009","unstructured":"Gould, R.J.: A look at cycles containing specified elements of a graph. Discr. Math. 309, 6299\u20136311 (2009)","journal-title":"Discr. Math."},{"key":"1818_CR11","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02759704","volume":"1","author":"J Moon","year":"1963","unstructured":"Moon, J., Moser, L.: On Hamiltonian bipartite graphs. Isr. J. Math. 1, 163\u2013165 (1963)","journal-title":"Isr. J. Math."},{"key":"1818_CR12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2308928","volume":"67","author":"O Ore","year":"1960","unstructured":"Ore, O.: Note on Hamilton circuits. Am. Math. Mon. 67, 55 (1960)","journal-title":"Am. Math. Mon."},{"key":"1818_CR13","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1002\/jgt.3190160310","volume":"16","author":"R Shi","year":"1992","unstructured":"Shi, R.: 2-Neighborhoods and Hamiltonian conditions. J. Graph Theory 16, 267\u2013271 (1992)","journal-title":"J. Graph Theory"},{"key":"1818_CR14","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1006\/jctb.1996.0037","volume":"67","author":"H Wang","year":"1996","unstructured":"Wang, H.: On the maximum number of independent cycles in a bipartite graph. J. Combin. Theory Ser. B 67, 152\u2013164 (1996)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1818_CR15","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0012-365X(99)00009-6","volume":"205","author":"H Wang","year":"1999","unstructured":"Wang, H.: On the maximum number of independent cycles in a graph. Discr. Math. 205, 183\u2013190 (1999)","journal-title":"Discr. Math."},{"key":"1818_CR16","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/jgt.21807","volume":"78","author":"H Wang","year":"2015","unstructured":"Wang, H.: Partial degree conditions and cycles coverings. J. Graph Theory 78, 295\u2013304 (2015)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1818-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1818-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1818-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T14:50:15Z","timestamp":1498143015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1818-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,6]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["1818"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1818-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2017,6,6]]}}}