{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T23:37:55Z","timestamp":1720222675886},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,3,31]],"date-time":"2016-03-31T00:00:00Z","timestamp":1459382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s00373-016-1689-8","type":"journal-article","created":{"date-parts":[[2016,3,31]],"date-time":"2016-03-31T04:30:53Z","timestamp":1459398653000},"page":"2171-2181","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Vertex-Disjoint Cycles Containing Specified Vertices in a Bipartite Graph"],"prefix":"10.1007","volume":"32","author":[{"given":"Shaohua","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suyun","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,31]]},"reference":[{"key":"1689_CR1","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s003730050004","volume":"16","author":"G Chen","year":"2000","unstructured":"Chen, G., Faudree, R.J., Gould, R.J., Jacobson, M.S., Lesniak, L.: Cycles in 2-factors of balanced bipartite graphs. Graphs Comb. 16, 67\u201380 (2000)","journal-title":"Graphs Comb."},{"key":"1689_CR2","doi-asserted-by":"crossref","unstructured":"Corr $${\\acute{\\rm a}}$$ a \u00b4 di, K., Hajnal, A.: On the maximal number of independent circuits in a graph. Acta Math. Acad. Sci. Hung 14, 423\u2013439 (1963)","DOI":"10.1007\/BF01895727"},{"key":"1689_CR3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0012-365X(84)90050-5","volume":"50","author":"M El-Zahar","year":"1984","unstructured":"El-Zahar, M.: On circuits in graphs. Discrete Math. 50, 227\u2013230 (1984)","journal-title":"Discrete Math."},{"key":"1689_CR4","unstructured":"Erd\u0151s, P.: Some recent combinatorial problems. Technical Report, University of Bielefeld, (1990)"},{"key":"1689_CR5","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s003730050005","volume":"16","author":"Y Egawa","year":"2000","unstructured":"Egawa, Y., Faudree, R.J., Gy\u0151ri, E., Ishigami, Y., Schelp, R.H., Wang, H.: Vertex-disjoint cycles containing specified edges. Graphs Comb. 16, 81\u201392 (2000)","journal-title":"Graphs Comb."},{"key":"1689_CR6","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-factor with cycles containing specified vertices in a bipartite graph. J. Appl. Math Comput. 31, 203\u2013215 (2009)","journal-title":"J. Appl. Math Comput."},{"key":"1689_CR7","unstructured":"Gao, Y.: Degree conditions for vertex-disjoint cycles and specified factors in graphs. Doctoral dissertation Shandong University (2009)"},{"key":"1689_CR8","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.disc.2005.03.011","volume":"297","author":"H Matsumura","year":"2005","unstructured":"Matsumura, H.: Vertex-disjoint 4-cycles containing specified edge in a bipartite graph. Discrete Math. 297, 78\u201390 (2005)","journal-title":"Discrete Math."},{"key":"1689_CR9","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. Comb. Theory Ser. B 67, 152\u2013164 (1996)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1689_CR10","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/(SICI)1097-0118(199908)31:4<333::AID-JGT8>3.0.CO;2-4","volume":"31","author":"H Wang","year":"1999","unstructured":"Wang, H.: Proof of a conjecture on cycles in a bipartite graph. J. Graph Theory 31, 333\u2013343 (1999)","journal-title":"J. Graph Theory"},{"key":"1689_CR11","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1007\/s00373-010-0948-3","volume":"26","author":"H Wang","year":"2010","unstructured":"Wang, H.: Proof of the Erd\u0151s-Faudree conjecture on quadrilaterals. Graphs Comb. 26, 833\u2013877 (2010)","journal-title":"Graphs Comb."},{"key":"1689_CR12","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1007\/s10114-005-0666-6","volume":"22","author":"J Yan","year":"2006","unstructured":"Yan, J., Liu, G.: On 2-factors with prescribed properties in a bipartite graph. Acta Math. Sin. Engl. Ser. 22, 1115\u20131120 (2006)","journal-title":"Acta Math. Sin. Engl. Ser."},{"key":"1689_CR13","doi-asserted-by":"crossref","first-page":"3930","DOI":"10.1016\/j.disc.2007.07.098","volume":"308","author":"J Yan","year":"2008","unstructured":"Yan, J.: Disjoint triangles and quadrilaterals in a graph. Discrete Math. 308, 3930\u20133937 (2008)","journal-title":"Discrete Math."},{"key":"1689_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s12190-008-0050-7","volume":"27","author":"J Yan","year":"2008","unstructured":"Yan, J., Liu, G.: Vertex-disjoint quadrilaterals containing specified edge in a bipartite graph. J. Appl. Math Comput. 27, 23\u201331 (2008)","journal-title":"J. Appl. Math Comput."},{"key":"1689_CR15","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1016\/j.disc.2007.11.072","volume":"309","author":"J Yan","year":"2009","unstructured":"Yan, J., Liu, G.: On 2-factor with cycles containing specified edges in a bipartite graph. Discrete Math. 309, 1112\u20131117 (2009)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1689-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-016-1689-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1689-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:42Z","timestamp":1559055582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-016-1689-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,31]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["1689"],"URL":"https:\/\/doi.org\/10.1007\/s00373-016-1689-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,31]]}}}