{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T22:50:07Z","timestamp":1779231007940,"version":"3.51.4"},"reference-count":261,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["17K05347"],"award-info":[{"award-number":["17K05347"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["16K05262"],"award-info":[{"award-number":["16K05262"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["17K05348"],"award-info":[{"award-number":["17K05348"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008608","name":"Sumitomo Foundation","doi-asserted-by":"publisher","award":["170149"],"award-info":[{"award-number":["170149"]}],"id":[{"id":"10.13039\/100008608","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":[[2018,1]]},"DOI":"10.1007\/s00373-017-1873-5","type":"journal-article","created":{"date-parts":[[2018,1,27]],"date-time":"2018-01-27T07:10:53Z","timestamp":1517037053000},"page":"1-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey"],"prefix":"10.1007","volume":"34","author":[{"given":"Shuya","family":"Chiba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoki","family":"Yamashita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,27]]},"reference":[{"key":"1873_CR1","unstructured":"Abbasi, S.: Ph.D Thesis (Rutgers University 1998)"},{"key":"1873_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1112\/jlms\/s2-48.1.39","volume":"48","author":"M Aigner","year":"1993","unstructured":"Aigner, M., Brandt, S.: Embedding arbitrary graphs of maximum degree two. J. Lond. Math. Soc. 48, 39\u201351 (1993)","journal-title":"J. Lond. Math. Soc."},{"key":"1873_CR3","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1112\/jlms\/s2-32.3.385","volume":"32","author":"A Ainouche","year":"1985","unstructured":"Ainouche, A., Christofides, N.: Condition for the existence of hamiltonian circuits in graphs based on vertex degrees. J. Lond. Math. Soc. 32, 385\u2013391 (1985)","journal-title":"J. Lond. Math. Soc."},{"key":"1873_CR4","first-page":"193","volume":"51","author":"AA Ali","year":"1999","unstructured":"Ali, A.A., Staton, W.: The extremal question for cycles with chords. Ars Comb. 51, 193\u2013197 (1999)","journal-title":"Ars Comb."},{"key":"1873_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1006\/jctb.1996.0062","volume":"68","author":"N Alon","year":"1996","unstructured":"Alon, N.: Disjoint directed cycles. J. Comb. Theory Ser. B 68, 167\u2013178 (1996)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR6","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0012-365X(95)00242-O","volume":"152","author":"N Alon","year":"1996","unstructured":"Alon, N., Fischer, E.: 2-factors in dense graphs. Discret. Math. 152, 13\u201323 (1996)","journal-title":"Discret. Math."},{"key":"1873_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1006\/jctb.1996.0020","volume":"66","author":"N Alon","year":"1996","unstructured":"Alon, N., Yuster, R.: $$H$$-factors in dense graphs. J. Comb. Theory Ser. B 66, 269\u2013282 (1996)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(86)90181-0","volume":"58","author":"D Amar","year":"1986","unstructured":"Amar, D.: Partition of a bipartite hamiltonian graph into two cycles. Discrete Math. 58, 1\u201310 (1986)","journal-title":"Discrete Math."},{"key":"1873_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.7494\/OpMath.2009.29.4.345","volume":"29","author":"D Amar","year":"2009","unstructured":"Amar, D., Flandrin, E., Gancarzewicz, G.: Cyclability in bipartite graphs. Opusc. Math. 29, 345\u2013364 (2009)","journal-title":"Opusc. Math."},{"key":"1873_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(94)00275-N","volume":"149","author":"T Andreae","year":"1996","unstructured":"Andreae, T.: On independent cycles and edges in graphs. Discrete Math. 149, 291\u2013297 (1996)","journal-title":"Discrete Math."},{"key":"1873_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1002\/jgt.20349","volume":"60","author":"ChS Babu","year":"2009","unstructured":"Babu, ChS, Diwan, A.A.: Disjoint cycles with chords in graphs. J. Graph Theory 60, 87\u201398 (2009)","journal-title":"J. Graph Theory"},{"key":"1873_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.jctb.2017.07.002","volume":"128","author":"P Balister","year":"2018","unstructured":"Balister, P., Li, H., Schelp, R.: Decompositions of graphs into cycles with chords. J. Combin. Theory Ser. B 128, 47\u201365 (2018)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1873_CR13","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1002\/jgt.22124","volume":"86","author":"A Ban","year":"2017","unstructured":"Ban, A.: Decomposing weighted graphs. J. Graph Theory 86, 250\u2013254 (2017)","journal-title":"J. Graph Theory"},{"key":"1873_CR14","first-page":"79","volume":"46","author":"R Bauer","year":"2010","unstructured":"Bauer, R., Wang, H.: Disjoint triangles and pentagons in a graph. Australas. J. Comb. 46, 79\u201389 (2010)","journal-title":"Australas. J. Comb."},{"key":"1873_CR15","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1016\/j.dam.2006.10.005","volume":"155","author":"C Bazgan","year":"2007","unstructured":"Bazgan, C., Tuza, Z., Vanderpooten, D.: Efficient algorithms for decomposing graphs under degree constraints. Discrete Appl. Math. 155, 979\u2013988 (2007)","journal-title":"Discrete Appl. Math."},{"key":"1873_CR16","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.dam.2008.07.002","volume":"157","author":"S Bekkai","year":"2009","unstructured":"Bekkai, S., Kouider, M.: On pseudo 2-factors. Discrete Appl. Math. 157, 774\u2013779 (2009)","journal-title":"Discrete Appl. Math."},{"key":"1873_CR17","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0012-365X(83)90264-9","volume":"46","author":"KE Berman","year":"1983","unstructured":"Berman, K.E.: Proof of a conjecture of H\u00e4ggkvist on cycles and independent edges. Discrete Math. 46, 9\u201313 (1983)","journal-title":"Discrete Math."},{"key":"1873_CR18","first-page":"41","volume":"15","author":"JC Bermond","year":"1976","unstructured":"Bermond, J.C.: On hamiltonian walks. Congr. Numer. 15, 41\u201351 (1976)","journal-title":"Congr. Numer."},{"key":"1873_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.3190050102","volume":"5","author":"JC Bermond","year":"1981","unstructured":"Bermond, J.C., Thomassen, C.: Cycles in digraphs-a survey. J. Graph Theory 5, 1\u201343 (1981)","journal-title":"J. Graph Theory"},{"key":"1873_CR20","doi-asserted-by":"publisher","first-page":"5886","DOI":"10.1016\/j.disc.2007.10.040","volume":"308","author":"A Bialostocki","year":"2008","unstructured":"Bialostocki, A., Finkel, D., Gy\u00e1rf\u00e1s, A.: Disjoint chorded cycles in graphs. Discrete Math. 308, 5886\u20135890 (2008)","journal-title":"Discrete Math."},{"key":"1873_CR21","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s00493-007-0047-0","volume":"27","author":"E Birmel\u00e9","year":"2007","unstructured":"Birmel\u00e9, E., Bondy, J.A., Reed, B.A.: The Erd\u0151s-P\u00f3sa property for long circuits. Combinatorica 27, 135\u2013145 (2007)","journal-title":"Combinatorica"},{"key":"1873_CR22","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01303200","volume":"13","author":"B Bollob\u00e1s","year":"1993","unstructured":"Bollob\u00e1s, B., Brightwell, C.: Cycles through specified vertices. Combinatorica 13, 147\u2013155 (1993)","journal-title":"Combinatorica"},{"key":"1873_CR23","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0095-8956(78)90030-8","volume":"25","author":"B Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s, B., Eldridge, S.E.: Packings of graphs and applications to computational complexity. J. Comb. Theory Ser. B 25, 105\u2013124 (1978)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR24","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1002\/rsa.10062","volume":"21","author":"B Bollab\u00e1s","year":"2002","unstructured":"Bollab\u00e1s, B., Scott, A.D.: Problems and results on judicious partitions. Random Struct. Algorithms 21, 414\u2013430 (2002)","journal-title":"Random Struct. Algorithms"},{"key":"1873_CR25","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0012-365X(78)90124-3","volume":"22","author":"JA Bondy","year":"1978","unstructured":"Bondy, J.A.: A remark on two sufficient conditions for Hamilton cycles. Discrete Math. 22, 191\u2013193 (1978)","journal-title":"Discrete Math."},{"key":"1873_CR26","unstructured":"Bondy, J.A.: Longest paths and cycles in graphs of high degree, Research Report CORR 80\u201316, University of Waterloo, Waterloo, Ont., (1980)"},{"key":"1873_CR27","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/(SICI)1097-0118(199702)24:2<165::AID-JGT4>3.0.CO;2-O","volume":"24","author":"S Brandt","year":"1997","unstructured":"Brandt, S., Chen, G., Faudree, R.J., Gould, R.J., Lesniak, L.: Degree conditions for 2-factors. J. Graph Theory 24, 165\u2013173 (1997)","journal-title":"J. Graph Theory"},{"key":"1873_CR28","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1002\/(SICI)1097-0118(199812)29:4<227::AID-JGT2>3.0.CO;2-W","volume":"29","author":"H Broersma","year":"1998","unstructured":"Broersma, H., Tuinstra, H.: Independence trees and Hamilton cycles. J. Graph Theory 29, 227\u2013237 (1998)","journal-title":"J. Graph Theory"},{"key":"1873_CR29","unstructured":"Bruhn, H., Joos, F., Schaudt, O.: Long cycles through prescribed vertices have the Erd\u0151s-P\u00f3sa property, arXiv:1412.2894"},{"key":"1873_CR30","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1002\/jgt.20605","volume":"70","author":"A Bush","year":"2012","unstructured":"Bush, A., Zhao, Y.: Minimum degree thresholds for bipartite graph tiling. J. Graph Theory 70, 92\u2013120 (2012)","journal-title":"J. Graph Theory"},{"key":"1873_CR31","unstructured":"Catlin, P.A.: Embedding subgraphs and coloring graphs under extremal degree conditions, Ph. D. Thesis, Ohio State Univ., Columbus (1976)"},{"key":"1873_CR32","first-page":"37","volume":"23","author":"G Chen","year":"2001","unstructured":"Chen, G., Enomoto, H., Kawarabayashi, K., Ota, K., Lou, D., Saito, A.: Vertex-disjoint cycles containing specified edges in a bipartite graph. Australas. J. Comb. 23, 37\u201348 (2001)","journal-title":"Australas. J. Comb."},{"key":"1873_CR33","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/jgt.10159","volume":"46","author":"G Chen","year":"2004","unstructured":"Chen, G., Enomoto, H., Kawarabayashi, K., Ota, K., Lou, D., 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":"1873_CR34","doi-asserted-by":"publisher","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":"1873_CR35","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1137\/130929837","volume":"29","author":"G Chen","year":"2015","unstructured":"Chen, G., Gould, R.J., Hirohata, K., Ota, K., Shan, S.: Disjoint chorded cycles of the same length. SIAM J. Discrete Math. 29, 1030\u20131041 (2015)","journal-title":"SIAM J. Discrete Math."},{"key":"1873_CR36","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0012-365X(99)90061-4","volume":"197\u2013198","author":"G Chen","year":"1999","unstructured":"Chen, G., Gould, R.J., Jacobson, M.S.: On 2-factors containing 1-factors in bipartite graphs. Discrete Math. 197\u2013198, 185\u2013194 (1999)","journal-title":"Discrete Math."},{"key":"1873_CR37","doi-asserted-by":"publisher","first-page":"401","DOI":"10.7151\/dmgt.1370","volume":"27","author":"G Chen","year":"2007","unstructured":"Chen, G., Gould, R.J., Kawarabayashi, K., Ota, K., Saito, A., Schiermeyer, I.: The Chv\u00e1tal-Erd\u0151s condition and 2-factors with a specified number of components. Discuss. Math. Graph Theory 27, 401\u2013407 (2007)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1873_CR38","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1006\/jctb.1994.1019","volume":"60","author":"G Chen","year":"1994","unstructured":"Chen, G., Saito, A.: Graphs with a cycle of length divisible by three. J. Comb. Theory Ser. B 60, 277\u2013292 (1994)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR39","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/PL00007239","volume":"17","author":"Y Chen","year":"2001","unstructured":"Chen, Y., Tian, F., Wei, B.: Degree sums and path-factors in graphs. Graphs Comb. 17, 61\u201371 (2001)","journal-title":"Graphs Comb."},{"key":"1873_CR40","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.endm.2017.06.044","volume":"61","author":"S Chiba","year":"2017","unstructured":"Chiba, S.: On the difference between hamilton cycles and 2-factors with a prescribed number of cycles. Electr. Notes Discrete Math. 61, 239\u2013245 (2017)","journal-title":"Electr. Notes Discrete Math."},{"key":"1873_CR41","first-page":"203","volume":"46","author":"S Chiba","year":"2010","unstructured":"Chiba, S., Egawa, Y., Yoshimoto, K.: A 2-factor in which each cycle contains a vertex in a specified stable set. Australas. J. Comb. 46, 203\u2013210 (2010)","journal-title":"Australas. J. Comb."},{"key":"1873_CR42","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.disc.2012.10.010","volume":"313","author":"S Chiba","year":"2013","unstructured":"Chiba, S., Fujita, S.: Covering vertices by a specified number of disjoint cycles, edges and isolated vertices. Discrete Math. 313, 269\u2013277 (2013)","journal-title":"Discrete Math."},{"key":"1873_CR43","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s00373-010-0901-5","volume":"26","author":"S Chiba","year":"2010","unstructured":"Chiba, S., Fujita, S., Gao, Y., Li, G.: On a sharp degree sum condition for disjoint chorded cycles in graphs. Graphs Comb. 26, 173\u2013186 (2010)","journal-title":"Graphs Comb."},{"key":"1873_CR44","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.aam.2013.12.001","volume":"54","author":"S Chiba","year":"2014","unstructured":"Chiba, S., Fujita, S., Kawarabayashi, K., Sakuma, T.: Minimum degree conditions for vertex-disjoint even cycles in large graphs. Adv. Appl. Math. 54, 105\u2013120 (2014)","journal-title":"Adv. Appl. Math."},{"key":"1873_CR45","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.dam.2017.10.029","volume":"236","author":"S Chiba","year":"2018","unstructured":"Chiba, S., Lichiardopol, N.: On the existence of vertex-disjoint subgraphs with high degree sum. Discrete Appl. Math. 236, 84\u201395 (2018)","journal-title":"Discrete Appl. Math."},{"key":"1873_CR46","first-page":"91","volume":"47","author":"S Chiba","year":"2010","unstructured":"Chiba, S., Matsubara, R., Tsugaki, M.: Relationships between the length of a longest path and the relative length. Australas. J. Comb. 47, 91\u2013107 (2010)","journal-title":"Australas. J. Comb."},{"key":"1873_CR47","first-page":"441","volume":"113","author":"S Chiba","year":"2014","unstructured":"Chiba, S., Tsugaki, M.: A degree sum condition for the existence of a path-factor. Ars Comb. 113, 441\u2013450 (2014)","journal-title":"Ars Comb."},{"key":"1873_CR48","doi-asserted-by":"publisher","first-page":"2871","DOI":"10.1016\/j.disc.2017.07.028","volume":"340","author":"S Chiba","year":"2017","unstructured":"Chiba, S., Yamashita, T.: A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs. Discrete Math. 340, 2871\u20132877 (2017)","journal-title":"Discrete Math."},{"key":"1873_CR49","unstructured":"Chiba, S., Yamashita, T.: On directed 2-factors in digraphs and 2-factors containing perfect matchings in bipartite graphs, accepted in SIAM Journal on Discrete Math. ( arXiv:1612.08904 )"},{"key":"1873_CR50","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1016\/j.disc.2016.12.010","volume":"340","author":"S Chiba","year":"2017","unstructured":"Chiba, S., Yamashita, T.: Degree sum conditions for vertex-disjoint cycles passing through specified vertices. Discrete Math. 340, 678\u2013690 (2017)","journal-title":"Discrete Math."},{"key":"1873_CR51","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0012-365X(72)90079-9","volume":"2","author":"V Chv\u00e1tal","year":"1972","unstructured":"Chv\u00e1tal, V., Erd\u0151s, P.: A note on hamiltonian circuits. Discrete Math. 2, 111\u2013113 (1972)","journal-title":"Discrete Math."},{"key":"1873_CR52","unstructured":"Coll, V., Halperin, A., Magnant, C., Salehi-Nowbandegani, P.: Enomoto and Ota\u2019s conjecture holds for large graphs, arXiv:1408.0408"},{"key":"1873_CR53","doi-asserted-by":"publisher","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. Hung. 14, 423\u2013439 (1963)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"1873_CR54","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1007\/s00373-016-1729-4","volume":"32","author":"M Cream","year":"2016","unstructured":"Cream, M., Faudree, R.J., Gould, R.J., Hirohata, K.: Chorded cycles. Graphs Comb. 32, 2295\u20132313 (2016)","journal-title":"Graphs Comb."},{"key":"1873_CR55","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s00493-003-0013-4","volume":"23","author":"B Csaba","year":"2003","unstructured":"Csaba, B., Shokoufandeh, A., Szemer\u00e9di, E.: Proof of a conjecture of Bollob\u00e1s and Eldridge for graphs of maximum degree three, Paul Erd\u0151s and his mathematics (Budapest, 1999). Combinatorica 23, 35\u201372 (2003)","journal-title":"Combinatorica"},{"key":"1873_CR56","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.jctb.2017.04.005","volume":"126","author":"E Cs\u00f3ka","year":"2017","unstructured":"Cs\u00f3ka, E., Lo, I., Norin, S., Wu, H., Yepremyan, L.: The extremal function for disconnected minors. J. Comb. Theory Ser. B 126, 162\u2013174 (2017)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR57","first-page":"373","volume":"14","author":"J Czipszer","year":"1963","unstructured":"Czipszer, J.: Solution to problem 127 (Hungarian). Mat. Lapok 14, 373\u2013374 (1963)","journal-title":"Mat. Lapok"},{"key":"1873_CR58","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1137\/080739513","volume":"24","author":"A Czygrinow","year":"2010","unstructured":"Czygrinow, A., DeBiasio, L., Kierstead, H.A.: 2-factors of bipartite graphs with asymmetric minimum degrees. SIAM J. Discrete Math. 24, 486\u2013504 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"1873_CR59","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.disc.2013.12.005","volume":"320","author":"L DeBiasio","year":"2014","unstructured":"DeBiasio, L., Ferrara, M., Morris, T.: Improved degree conditions for 2-factors with $$k$$ cycles in hamiltonian graphs. Discrete Math. 320, 51\u201354 (2014)","journal-title":"Discrete Math."},{"key":"1873_CR60","volume-title":"Graduate Texts in mathematics, 173","author":"R Diestel","year":"2010","unstructured":"Diestel, R.: Graph theory, 4th edition. In: Axler, S., Ribet, K.A. (eds.) Graduate Texts in mathematics, 173. Springer, Heidelberg (2010)"},{"key":"1873_CR61","doi-asserted-by":"publisher","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, 69\u201381 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"1873_CR62","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/BF02992869","volume":"26","author":"GA Dirac","year":"1963","unstructured":"Dirac, G.A.: On the maximal number of independent triangles in graphs. Abh. Math. Semin. Univ. Hamb. 26, 78\u201382 (1963)","journal-title":"Abh. Math. Semin. Univ. Hamb."},{"key":"1873_CR63","doi-asserted-by":"publisher","first-page":"183","DOI":"10.4153\/CMB-1963-019-5","volume":"6","author":"GA Dirac","year":"1963","unstructured":"Dirac, G.A.: Some results concerning the structure of graphs. Can. Math. Bull. 6, 183\u2013210 (1963)","journal-title":"Can. Math. Bull."},{"key":"1873_CR64","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01901931","volume":"14","author":"GA Dirac","year":"1963","unstructured":"Dirac, G.A., Erd\u0151s, P.: On the maximal number of independent circuits in a graph. Acta Math. Acad. Sci. Hung. 14, 79\u201394 (1963)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"1873_CR65","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1002\/(SICI)1097-0118(200004)33:4<237::AID-JGT4>3.0.CO;2-A","volume":"33","author":"A Diwan","year":"2000","unstructured":"Diwan, A.: Decomposing graphs with girth at least five under degree constraints. J. Graph Theory 33, 237\u2013239 (2000)","journal-title":"J. Graph Theory"},{"key":"1873_CR66","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s12190-009-0333-7","volume":"34","author":"J Dong","year":"2010","unstructured":"Dong, J.: Small cycles and 2-factor passing through any given vertices in graphs. J. Appl. Math. Comput. 34, 485\u2013493 (2010)","journal-title":"J. Appl. Math. Comput."},{"key":"1873_CR67","first-page":"275","volume":"121","author":"J Dong","year":"2015","unstructured":"Dong, J., Li, X.: An improved Fan-type degree condition for $$k$$-linked graphs. Ars Comb. 121, 275\u2013279 (2015)","journal-title":"Ars Comb."},{"key":"1873_CR68","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1006\/jctb.1996.0015","volume":"66","author":"Y Egawa","year":"1996","unstructured":"Egawa, Y.: Vertex-disjoint cycles of the same length. J. Comb. Theory Ser. B 66, 168\u2013200 (1996)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR69","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1002\/jgt.10113","volume":"43","author":"Y Egawa","year":"2003","unstructured":"Egawa, Y., Enomoto, H., Faudree, R.J., Li, H., Schiermeyer, I.: Two-factors each component of which contains a specified vertex. J. Graph Theory 43, 188\u2013198 (2003)","journal-title":"J. Graph Theory"},{"key":"1873_CR70","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s003730050005","volume":"16","author":"Y Egawa","year":"2000","unstructured":"Egawa, Y., Faudree, R.J., Gy\u00f6ri, 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":"1873_CR71","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.disc.2005.10.017","volume":"305","author":"Y Egawa","year":"2005","unstructured":"Egawa, Y., Fujita, S., Kawarabayashi, K., Wang, H.: Existence of two disjoint long cycles in graphs. Discrete Math. 305, 154\u2013169 (2005)","journal-title":"Discrete Math."},{"key":"1873_CR72","unstructured":"Egawa, Fujita, Ota and Sakuma, in preparation"},{"key":"1873_CR73","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0012-365X(02)00831-2","volume":"270","author":"Y Egawa","year":"2003","unstructured":"Egawa, Y., Hagita, M., Kawarabayashi, K., Wang, H.: Covering vertices of a graph by $$k$$ disjoint cycles. Discrete Math. 270, 115\u2013125 (2003)","journal-title":"Discrete Math."},{"key":"1873_CR74","first-page":"23","volume":"61","author":"Y Egawa","year":"2001","unstructured":"Egawa, Y., Ota, K.: Vertex-disjoint paths in graphs. Ars Comb. 61, 23\u201331 (2001)","journal-title":"Ars Comb."},{"key":"1873_CR75","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0012-365X(84)90050-5","volume":"50","author":"MH El-Zah\u00e1r","year":"1984","unstructured":"El-Zah\u00e1r, M.H.: On circuits in graphs. Discrete Math. 50, 227\u2013230 (1984)","journal-title":"Discrete Math."},{"key":"1873_CR76","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/jctb.1995.1007","volume":"63","author":"H Enomoto","year":"1995","unstructured":"Enomoto, H.: Graph decompositions without isolated vertices. J. Comb. Theory Ser. B 63, 111\u2013124 (1995)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR77","doi-asserted-by":"publisher","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":"1873_CR78","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0012-365X(00)00229-6","volume":"233","author":"H Enomoto","year":"2001","unstructured":"Enomoto, H.: Graph partition problems into cycles and paths. Discrete Math. 233, 93\u2013101 (2001)","journal-title":"Discrete Math."},{"key":"1873_CR79","unstructured":"Enomoto, H., Kaneko, A., Tuza, Z.S.: $$P_{3}$$-factor and covering cycles in graphs of minimum degree $$\\frac{n}{3}$$, Colloq. Math. Soc. Janos Bolyai 52. Combinatorics Eger Hungary (1987)"},{"key":"1873_CR80","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0012-365X(03)00300-5","volume":"276","author":"H Enomoto","year":"2004","unstructured":"Enomoto, H., Li, H.: Partition of a graph into cycles and degenerated cycles. Discrete Math. 276, 177\u2013181 (2004)","journal-title":"Discrete Math."},{"key":"1873_CR81","first-page":"33","volume":"91","author":"H Enomoto","year":"2009","unstructured":"Enomoto, H., Matsumura, H.: Cycle-partitions with specified vertices and edges. Ars Comb. 91, 33\u201351 (2009)","journal-title":"Ars Comb."},{"key":"1873_CR82","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1002\/1097-0118(200006)34:2<163::AID-JGT5>3.0.CO;2-K","volume":"34","author":"H Enomoto","year":"2000","unstructured":"Enomoto, H., Ota, K.: Partitions of a graph into paths with prescribed endvertices and lengths. J. Graph Theory 34, 163\u2013169 (2000)","journal-title":"J. Graph Theory"},{"key":"1873_CR83","unstructured":"Erd\u0151s, P.: Problem 9. In: Fiedler, M. (ed.) Theory of Graphs and its Applications Czech. p. 159, Academy of Sciences, Prague (1964)"},{"key":"1873_CR84","unstructured":"Erd\u0151s, P.: Some recent combinatorial problems, Technical Report, University of Bielefeld (Nov. 1990)"},{"key":"1873_CR85","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02024498","volume":"10","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., Gallai, T.: On maximal paths and circuits of graphs. Acta Math. Acad. Sci. Hung. 10, 337\u2013356 (1959)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"1873_CR86","doi-asserted-by":"crossref","first-page":"3","DOI":"10.5486\/PMD.1962.9.1-2.02","volume":"9","author":"P Erd\u0151s","year":"1962","unstructured":"Erd\u0151s, P., P\u00f3sa, L.: On the maximal number of disjoint circuits of a graph. Publ. Math. Debr. 9, 3\u201312 (1962)","journal-title":"Publ. Math. Debr."},{"key":"1873_CR87","doi-asserted-by":"publisher","first-page":"347","DOI":"10.4153\/CJM-1965-035-8","volume":"17","author":"P Erd\u0151s","year":"1965","unstructured":"Erd\u0151s, P., P\u00f3sa, L.: On independent circuits contained in a graph. Can. J. Math. 17, 347\u2013352 (1965)","journal-title":"Can. J. Math."},{"key":"1873_CR88","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0095-8956(84)90054-6","volume":"37","author":"GH Fan","year":"1984","unstructured":"Fan, G.H.: New sufficient conditions for cycles in graphs. J. Comb. Theory Ser. B 37, 221\u2013227 (1984)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR89","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1006\/jctb.1996.0039","volume":"67","author":"G Fan","year":"1996","unstructured":"Fan, G., Kierstead, H.A.: Hamiltonian square-paths. J. Comb. Theory Ser. B 67, 167\u2013182 (1996)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR90","first-page":"29","volume":"76","author":"RJ Faudree","year":"2005","unstructured":"Faudree, R.J., Gould, R.J.: A note on neighborhood unions and independent cycles. Ars Comb. 76, 29\u201331 (2005)","journal-title":"Ars Comb."},{"key":"1873_CR91","doi-asserted-by":"publisher","first-page":"2772","DOI":"10.1016\/j.disc.2013.08.012","volume":"313","author":"RJ Faudree","year":"2013","unstructured":"Faudree, R.J., Gould, R.J.: Precise location of vertices on Hamiltonian cycles. Discrete Math. 313, 2772\u20132777 (2013)","journal-title":"Discrete Math."},{"key":"1873_CR92","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.disc.2004.05.008","volume":"286","author":"RJ Faudree","year":"2004","unstructured":"Faudree, R.J., Gould, R.J., Jacobson, M., Lesniak, L., Saito, A.: Toughness, degrees and 2-factors. Discrete Math. 286, 245\u2013249 (2004)","journal-title":"Discrete Math."},{"key":"1873_CR93","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.disc.2005.06.005","volume":"300","author":"RJ Faudree","year":"2005","unstructured":"Faudree, R.J., Gould, R.J., Jacobson, M., Lesniak, L., Saito, A.: A note on 2-factors with two components. Discrete Math. 300, 218\u2013224 (2005)","journal-title":"Discrete Math."},{"key":"1873_CR94","volume-title":"Topics in structural graph theory (Encyclopedia of Mathematics and its Applications 147)","author":"M Ferrara","year":"2013","unstructured":"Ferrara, M., Gould, R.J.: $$H$$-linked graphs. In: Beineke, L.W., Wilson, R.J. (eds.) Topics in structural graph theory (Encyclopedia of Mathematics and its Applications 147). Cambridge University Press, Cambridge (2013)"},{"key":"1873_CR95","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/jgt.20632","volume":"71","author":"M Ferrara","year":"2012","unstructured":"Ferrara, M., Gould, R., Jacobson, M., Pfender, F., Powell, J., Whalen, T.: New Ore-type conditions for $$H$$-linked graphs. J. Graph Theory 71, 69\u201377 (2012)","journal-title":"J. Graph Theory"},{"key":"1873_CR96","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s00373-006-0651-6","volume":"22","author":"M Ferrara","year":"2006","unstructured":"Ferrara, M., Gould, R.J., Tansey, G., Whalen, T.: On $$H$$-linked graphs. Graphs Comb. 22, 217\u2013224 (2006)","journal-title":"Graphs Comb."},{"key":"1873_CR97","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/j.disc.2011.08.029","volume":"312","author":"MJ Ferrara","year":"2012","unstructured":"Ferrara, M.J., Jacobson, M.S., Powell, J.: Characterizing degree-sum maximal nonhamiltonian bipartite graphs. Discrete Math. 312, 459\u2013461 (2012)","journal-title":"Discrete Math."},{"key":"1873_CR98","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-1-4757-3023-4_4","volume-title":"Handbook of Combinatorial Optimization, Supplement,","author":"P Festa","year":"1999","unstructured":"Festa, P., Pardalos, P.M., Resenda, M.G.C.: Feedback set problems. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, Supplement, vol. A, pp. 209\u2013258. Kluwer Acad. Publ., Dordrecht (1999)"},{"key":"1873_CR99","doi-asserted-by":"publisher","first-page":"5265","DOI":"10.1016\/j.disc.2007.09.035","volume":"308","author":"D Finkel","year":"2008","unstructured":"Finkel, D.: On the number of independent chorded cycle in a graph. Discrete Math. 308, 5265\u20135268 (2008)","journal-title":"Discrete Math."},{"key":"1873_CR100","first-page":"79","volume":"32","author":"S Fujita","year":"2005","unstructured":"Fujita, S.: Partition of a graph into cycles and isolated vertices. Australas. J. Comb. 32, 79\u201389 (2005)","journal-title":"Australas. J. Comb."},{"key":"1873_CR101","first-page":"189","volume":"31","author":"S Fujita","year":"2005","unstructured":"Fujita, S.: Vertex-disjoint copies of $$K_{4}^{-}$$ in graphs. Australas. J. Comb. 31, 189\u2013200 (2005)","journal-title":"Australas. J. Comb."},{"key":"1873_CR102","doi-asserted-by":"publisher","first-page":"3534","DOI":"10.1016\/j.disc.2007.12.056","volume":"309","author":"S Fujita","year":"2009","unstructured":"Fujita, S.: Degree conditions for the partition of a graph into cycles, edges and isolated vertices. Discrete Math. 309, 3534\u20133540 (2009)","journal-title":"Discrete Math."},{"key":"1873_CR103","first-page":"237","volume":"35","author":"S Fujita","year":"2006","unstructured":"Fujita, S., Matsumura, H., Tsugaki, M., Yamashita, T.: Degree sum condition and vertex-disjoint cycles in a graph. Austras. J. Comb. 35, 237\u2013255 (2006)","journal-title":"Austras. J. Comb."},{"key":"1873_CR104","volume-title":"Problem proposed in the \u201cFifth British Combinatorial Conference\u201d","author":"A Frank","year":"1975","unstructured":"Frank, A.: Problem proposed in the \u201cFifth British Combinatorial Conference\u201d. Aberdeen, Scotland (1975)"},{"key":"1873_CR105","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF02066678","volume":"12","author":"T Gallai","year":"1961","unstructured":"Gallai, T.: Maximum-minimum S\u00e4tze and verallgemeinerte Faktoren von Graphen. Acta Math. Acad. Sci. Hung. 12, 131\u2013173 (1961)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"1873_CR106","first-page":"415","volume":"98","author":"Y Gao","year":"2011","unstructured":"Gao, Y., Li, G.: On the maximum number of disjoint chorded cycles in graphs. Ars Comb. 98, 415\u2013422 (2011)","journal-title":"Ars Comb."},{"key":"1873_CR107","doi-asserted-by":"publisher","first-page":"2351","DOI":"10.1007\/s10114-011-9531-y","volume":"27","author":"Y Gao","year":"2011","unstructured":"Gao, Y., Li, G., Yan, J.: A vertex cover with chorded 4-cycles. Acta Math. Sin. 27, 2351\u20132360 (2011)","journal-title":"Acta Math. Sin."},{"key":"1873_CR108","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1007\/s00373-012-1200-0","volume":"29","author":"Y Gao","year":"2013","unstructured":"Gao, Y., Li, G., Yan, J.: Neighborhood unions for the existence of disjoint chorded cycles in graphs. Graphs Comb. 29, 1337\u20131345 (2013)","journal-title":"Graphs Comb."},{"key":"1873_CR109","doi-asserted-by":"publisher","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":"1873_CR110","first-page":"105","volume":"4","author":"RJ Gould","year":"2013","unstructured":"Gould, R.J., Hirohata, K., Horn, P.: Independent cycles and chorded cycles in graphs. J. Comb. 4, 105\u2013122 (2013)","journal-title":"J. Comb."},{"key":"1873_CR111","doi-asserted-by":"publisher","first-page":"2051","DOI":"10.1016\/j.disc.2015.05.010","volume":"338","author":"RJ Gould","year":"2015","unstructured":"Gould, R.J., Hirohata, K., Horn, P.: On independent doubly chorded cycles. Discrete Math. 338, 2051\u20132071 (2015)","journal-title":"Discrete Math."},{"key":"1873_CR112","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.disc.2017.08.030","volume":"341","author":"RJ Gould","year":"2018","unstructured":"Gould, R.J., Hirohata, K., Keller, A.: On vertex-disjoint cycles and degree sum conditions. Discrete Math. 341, 203\u2013212 (2018)","journal-title":"Discrete Math."},{"key":"1873_CR113","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1137\/12089569X","volume":"28","author":"R Gould","year":"2014","unstructured":"Gould, R., Horn, P., Magnant, C.: Multiply chorded cycles. SIAM J. Discrete Math. 28, 160\u2013172 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"1873_CR114","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/050624662","volume":"20","author":"RJ Gould","year":"2006","unstructured":"Gould, R.J., Kostochka, A., Yu, G.: On minimum degree implying that a graph is $$H$$-linked. SIAM J. Discrete Math. 20, 829\u2013840 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"1873_CR115","first-page":"211","volume":"79","author":"RJ Gould","year":"2006","unstructured":"Gould, R.J., Whalen, T.C.: Distance between two $$k$$-sets and path-systems extendibility. Ars Comb. 79, 211\u2013228 (2006)","journal-title":"Ars Comb."},{"key":"1873_CR116","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00373-006-0665-0","volume":"23","author":"RJ Gould","year":"2007","unstructured":"Gould, R.J., Whalen, T.: Subdivision extendibility. Graphs Comb. 23, 165\u2013182 (2007)","journal-title":"Graphs Comb."},{"key":"1873_CR117","unstructured":"Gould, R.J., Whalen, T.C.: Connectivity linkage, and hamilton path-systems in bipartite graphs, preprint. http:\/\/www.mathcs.emory.edu\/~whalen\/Articles\/bip.pdf"},{"key":"1873_CR118","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(80)90097-7","volume":"32","author":"RP Gupta","year":"1980","unstructured":"Gupta, R.P., Kahn, J., Robertson, N.: On the maximum number of diagonals of a circuit in a graph. Discrete Math. 32, 37\u201343 (1980)","journal-title":"Discrete Math."},{"key":"1873_CR119","unstructured":"Gy\u00f6ri, E.: On division of graphs to connected subgraphs, Combinatorics. In: Proc. Fifth Hungarian Colloq., Keszthely, 1976) I, pp. 485\u2013494, Colloq. Math. Soc. J\u00e1nos Bolyai 18, North-Holland, Amsterdam (1978)"},{"key":"1873_CR120","unstructured":"H\u00e4ggkvist, R.: On $$F$$-hamiltonian graphs. In: \u201cGraph Theory and Related Topics\u201d (Proc. Conf., univ. Waterloo, Waterloo, Ont., 1977) pp. 219\u2013231, Academic Press, New York-London (1979)"},{"key":"1873_CR121","first-page":"269","volume":"27","author":"R H\u00e4ggkvist","year":"1985","unstructured":"H\u00e4ggkvist, R.: Equicardinal disjoint cycles in sparse graphs. Ann. Discrete Math. 27, 269\u2013274 (1985)","journal-title":"Ann. Discrete Math."},{"key":"1873_CR122","first-page":"601","volume":"2","author":"A Hajnal","year":"1970","unstructured":"Hajnal, A., Szemer\u00e9di, E.: Proof of a conjecture of P. Erd\u0151s. Comb. Theory Appl. 2, 601\u2013623 (1970)","journal-title":"Comb. Theory Appl."},{"key":"1873_CR123","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02579344","volume":"3","author":"P Hajnal","year":"1983","unstructured":"Hajnal, P.: Partition of graphs with condition on the connectivity and minimum degree. Combinatorica 3, 95\u201399 (1983)","journal-title":"Combinatorica"},{"key":"1873_CR124","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1007\/s00373-013-1351-7","volume":"30","author":"M Hall","year":"2014","unstructured":"Hall, M., Magnant, C., Wang, H.: Note on Enomoto and Ota\u2019s conjecture for short paths in large graphs. Graphs Comb. 30, 1463\u20131467 (2014)","journal-title":"Graphs Comb."},{"key":"1873_CR125","doi-asserted-by":"publisher","first-page":"1974","DOI":"10.1016\/j.disc.2010.03.009","volume":"310","author":"J Harant","year":"2010","unstructured":"Harant, J., Rautenbach, D., Recht, P., Schiermeyer, I., Sprengel, E.-M.: Packing disjoint cycles over vertex cuts. Discrete Math. 310, 1974\u20131978 (2010)","journal-title":"Discrete Math."},{"key":"1873_CR126","doi-asserted-by":"publisher","first-page":"2336","DOI":"10.1137\/15M100852X","volume":"29","author":"DJ Harvey","year":"2015","unstructured":"Harvey, D.J., Wood, D.R.: Cycles of given size in a dense graph. SIAM J. Discrete Math. 29, 2336\u20132349 (2015)","journal-title":"SIAM J. Discrete Math."},{"key":"1873_CR127","first-page":"295","volume":"96","author":"K Hayashi","year":"2010","unstructured":"Hayashi, K.: Number of disjoint 5-cycles in graphs. Ars Comb. 96, 295\u2013320 (2010)","journal-title":"Ars Comb."},{"key":"1873_CR128","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/j.disc.2007.12.081","volume":"309","author":"Z Hu","year":"2009","unstructured":"Hu, Z., Li, H.: Weak cycle partition involving degree sum conditions. Discrete Math. 309, 647\u2013654 (2009)","journal-title":"Discrete Math."},{"key":"1873_CR129","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/jgt.1002","volume":"37","author":"Y Ishigami","year":"2001","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)","journal-title":"J. Graph Theory"},{"key":"1873_CR130","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1002\/jgt.10090","volume":"42","author":"Y Ishigami","year":"2003","unstructured":"Ishigami, Y., Jiang, T.: Vertex-disjoint cycles containing prescribed vertices. J. Graph Theory 42, 276\u2013296 (2003)","journal-title":"J. Graph Theory"},{"key":"1873_CR131","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0012-365X(01)00137-6","volume":"245","author":"Y Ishigami","year":"2002","unstructured":"Ishigami, Y., Wang, H.: An extension of a theorem on cycles containing specified independent edges. Discrete Math. 245, 127\u2013137 (2002)","journal-title":"Discrete Math."},{"key":"1873_CR132","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1007\/s00373-017-1818-z","volume":"33","author":"S Jiang","year":"2017","unstructured":"Jiang, S., Yan, J.: Partial Degree Conditions and Cycle Coverings in Bipartite Graphs. Graphs Comb. 33, 955\u2013967 (2017)","journal-title":"Graphs Comb."},{"key":"1873_CR133","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1016\/j.disc.2017.01.013","volume":"340","author":"Z Jiao","year":"2017","unstructured":"Jiao, Z., Wang, H., Yan, J.: Disjoint cycles in graphs with distance degree sum conditions. Discrete Math. 340, 1203\u20131209 (2017)","journal-title":"Discrete Math."},{"key":"1873_CR134","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/(SICI)1097-0118(199805)28:1<39::AID-JGT4>3.0.CO;2-G","volume":"28","author":"R Johansson","year":"1998","unstructured":"Johansson, R.: An El-Zah\u00e1r type condition ensuring path-factors. J. Graph Theory 28, 39\u201342 (1998)","journal-title":"J. Graph Theory"},{"key":"1873_CR135","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0167-5060(08)70503-X","volume":"3","author":"HA Jung","year":"1978","unstructured":"Jung, H.A.: On maximal circuits in finite graphs. Ann. Discrete Math. 3, 129\u2013144 (1978)","journal-title":"Ann. Discrete Math."},{"key":"1873_CR136","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0167-5060(08)70467-9","volume":"41","author":"P Justesen","year":"1989","unstructured":"Justesen, P.: On independent circuits in finite graphs and a conjecture of Erd\u0151s and P\u00f3sa. Ann. Discrete Math. 41, 299\u2013306 (1989)","journal-title":"Ann. Discrete Math."},{"key":"1873_CR137","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.jctb.2011.03.004","volume":"101","author":"N Kakimura","year":"2011","unstructured":"Kakimura, N., Kawarabayashi, K., Marx, D.: Packing cycles through prescribed vertices. J. Comb. Theory Ser. B 101, 378\u2013381 (2011)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR138","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1002\/(SICI)1097-0118(199801)27:1<7::AID-JGT2>3.0.CO;2-U","volume":"27","author":"A Kaneko","year":"1998","unstructured":"Kaneko, A.: On decomposition of triangle-free graphs under degree constraints. J. Graph Theory 27, 7\u20139 (1998)","journal-title":"J. Graph Theory"},{"key":"1873_CR139","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0012-365X(02)00506-X","volume":"257","author":"A Kaneko","year":"2002","unstructured":"Kaneko, A., Yoshimoto, K.: On a 2-factor with a specified edge in a graph satisfying the Ore condition. Discrete Math. 257, 445\u2013461 (2002)","journal-title":"Discrete Math."},{"key":"1873_CR140","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1002\/jgt.10119","volume":"43","author":"A Kaneko","year":"2003","unstructured":"Kaneko, A., Yoshimoto, K.: A 2-factor with two components of a graph satisfying the Chv\u00e1tal-Erd\u0151s condition. J. Graph Theory 43, 269\u2013279 (2003)","journal-title":"J. Graph Theory"},{"key":"1873_CR141","unstructured":"Kaneko, A., Yoshimoto, K.: On longest cycles in a balanced bipartite graph with Ore type condition. I, unpublished. http:\/\/trout.math.cst.nihon-u.ac.jp\/~yosimoto\/paper\/longest_bip2_en.pdf"},{"key":"1873_CR142","first-page":"169","volume":"68","author":"J K\u00e1ra","year":"2003","unstructured":"K\u00e1ra, J., Kr\u00e1l, D.: Minimum degree and the number of chords. Ars Comb. 68, 169\u2013179 (2003)","journal-title":"Ars Comb."},{"key":"1873_CR143","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"RM Karp","year":"1975","unstructured":"Karp, R.M.: On the omputational complexity of combinatorial problems. Networks 5, 45\u201368 (1975)","journal-title":"Networks"},{"key":"1873_CR144","unstructured":"Kawarabayashi, K.: A study on Hamiltonian cycles and related topics, doctoral thesis, Keio University (2000)"},{"key":"1873_CR145","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0012-365X(01)00349-1","volume":"248","author":"K Kawarabayashi","year":"2002","unstructured":"Kawarabayashi, K.: Graph partition into paths containing specified vertices. Discrete Math. 248, 271\u2013277 (2002)","journal-title":"Discrete Math."},{"key":"1873_CR146","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/jgt.10007","volume":"39","author":"K Kawarabayashi","year":"2002","unstructured":"Kawarabayashi, K.: $$K_{4}^{-}$$-factor in a graph. J. Graph Theory 39, 111\u2013128 (2002)","journal-title":"J. Graph Theory"},{"key":"1873_CR147","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1017\/S0963548305007479","volume":"15","author":"K Kawarabayashi","year":"2006","unstructured":"Kawarabayashi, K., Kostochka, A., Yu, G.: On sufficient degree conditions for a graph to be $$k$$-linked. Comb. Probab. Comput. 15, 685\u2013694 (2006)","journal-title":"Comb. Probab. Comput."},{"key":"1873_CR148","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.jctb.2007.07.003","volume":"98","author":"H Kierstead","year":"2008","unstructured":"Kierstead, H., Kostochka, A.: An Ore-type theorem on equitable coloring. J. Comb. Theory Ser. B 98, 226\u2013234 (2008)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR149","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1002\/jgt.22106","volume":"85","author":"HA Kierstead","year":"2017","unstructured":"Kierstead, H.A., Kostochka, A.V., McConvey, A.: Strengthening theorems of Dirac and Erd\u0151s on disjoint cycles. J Graph Theory 85, 788\u2013802 (2017)","journal-title":"J Graph Theory"},{"key":"1873_CR150","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.jctb.2016.05.007","volume":"122","author":"H Kierstead","year":"2017","unstructured":"Kierstead, H., Kostochka, A., Yeager, E.: On the Corr\u00e1di-Hajnal theorem and a question of Dirac. J. Comb. Theory Ser. B 122, 121\u2013148 (2017)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR151","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s00493-015-3291-8","volume":"37","author":"H Kierstead","year":"2017","unstructured":"Kierstead, H., Kostochka, A., Yeager, E.: The $$(2k--1)$$-connected multigraphs with at most $$k-1$$ disjoint cycles. Combinatorica 37, 77\u201386 (2017)","journal-title":"Combinatorica"},{"key":"1873_CR152","doi-asserted-by":"crossref","unstructured":"Kierstead, H.A., Kostochka, A.V., Yu, G.: Extremal graph packing problems. In: Surveys in Combinatorics, in: London Math. Soc. Lecture Notes Series, vol. 365, Cambridge University Press, pp. 113\u2013135 (2009)","DOI":"10.1017\/CBO9781107325975.006"},{"key":"1873_CR153","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s004930070020","volume":"20","author":"J Koml\u00f3s","year":"2000","unstructured":"Koml\u00f3s, J.: Tiling Tur\u00e1n theorems. Combinatorica 20, 203\u2013218 (2000)","journal-title":"Combinatorica"},{"key":"1873_CR154","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0012-365X(00)00279-X","volume":"235","author":"J Koml\u00f3s","year":"2001","unstructured":"Koml\u00f3s, J., S\u00e1rk\u00f6zy, G.N., Szemer\u00e9di, E.: Proof of the Alon-Yuster conjecture. Discrete Math. 235, 255\u2013269 (2001)","journal-title":"Discrete Math."},{"key":"1873_CR155","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01626028","volume":"2","author":"J Koml\u00f3s","year":"1998","unstructured":"Koml\u00f3s, J., S\u00e1rk\u00f6zy, G.N., Szemer\u00e9di, E.: Proof of the Seymour conjecture for large graphs. Ann. Comb. 2, 43\u201360 (1998)","journal-title":"Ann. Comb."},{"key":"1873_CR156","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1002\/jgt.20115","volume":"50","author":"A Kostochka","year":"2005","unstructured":"Kostochka, A., Yu, G.: An extremal problem for $$H$$-linked graphs. J. Graph Theory 50, 321\u2013339 (2005)","journal-title":"J. Graph Theory"},{"key":"1873_CR157","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1017\/S0963548306007899","volume":"16","author":"A Kostochka","year":"2007","unstructured":"Kostochka, A., Yu, G.: Ore-type graph packing problems. Comb. Prob. Comput. 16, 167\u2013169 (2007)","journal-title":"Comb. Prob. Comput."},{"key":"1873_CR158","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1002\/jgt.20295","volume":"58","author":"AV Kostochka","year":"2008","unstructured":"Kostochka, A.V., Yu, G.: Ore-type degree conditions for a graph to be $$H$$-linked. J. Graph Theory 58, 14\u201326 (2008)","journal-title":"J. Graph Theory"},{"key":"1873_CR159","doi-asserted-by":"publisher","first-page":"1542","DOI":"10.1016\/j.dam.2006.11.013","volume":"156","author":"A Kostochka","year":"2008","unstructured":"Kostochka, A., Yu, G.: Minimum degree conditions for $$H$$-linked graphs. Discrete Appl. Math. 156, 1542\u20131548 (2008)","journal-title":"Discrete Appl. Math."},{"key":"1873_CR160","doi-asserted-by":"publisher","first-page":"4762","DOI":"10.1016\/j.disc.2008.06.001","volume":"309","author":"A Kostochka","year":"2009","unstructured":"Kostochka, A., Yu, G.: Ore-type conditions implying 2-factors consisting of short cycles. Discrete Math. 309, 4762\u20134771 (2009)","journal-title":"Discrete Math."},{"key":"1873_CR161","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s00373-011-1066-6","volume":"28","author":"A Kostochka","year":"2012","unstructured":"Kostochka, A., Yu, G.: Graphs containing every 2-factor. Graphs Comb. 28, 687\u2013716 (2012)","journal-title":"Graphs Comb."},{"key":"1873_CR162","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/S0021-9800(69)80043-8","volume":"7","author":"HV Kronk","year":"1969","unstructured":"Kronk, H.V.: A note on $$k$$-path hamiltonian graphs. J. Comb. Theory Ser. B 7, 104\u2013106 (1969)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR163","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0095-8956(03)00028-5","volume":"88","author":"D K\u00fchn","year":"2003","unstructured":"K\u00fchn, D., Osthus, D.: Partitions of graphs with high minimum degree or connectivity. J. Comb. Theory Ser. B 88, 29\u201343 (2003)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR164","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s00493-009-2254-3","volume":"29","author":"D K\u00fchn","year":"2009","unstructured":"K\u00fchn, D., Osthus, D.: The minimum degree threshold for perfect graph packings. Combinatorica 29, 65\u2013107 (2009)","journal-title":"Combinatorica"},{"key":"1873_CR165","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1137\/080731256","volume":"23","author":"D K\u00fchn","year":"2009","unstructured":"K\u00fchn, D., Osthus, D., Treglown, A.: An Ore-type theorem for perfect packings in graphs. SIAM J. Discrete Math. 23, 1335\u20131355 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"1873_CR166","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1112\/plms\/s3-20.1.144","volume":"20","author":"DG Larman","year":"1970","unstructured":"Larman, D.G., Mani, P.: On the existence of certain configurations within graphs and the 1-skeletons of polytopes. Proc. Lond. Math. Soc. 20, 144\u2013160 (1970)","journal-title":"Proc. Lond. Math. Soc."},{"key":"1873_CR167","unstructured":"Las Vergnas, M.: Ph.D. Thesis, University of Paris (1972)"},{"key":"1873_CR168","first-page":"139","volume":"57","author":"R Li","year":"2013","unstructured":"Li, R., Ferrara, M., Zhang, X., Li, S.: A Fan-type degree condition for $$k$$-linked graphs. Australas. J. Comb. 57, 139\u2013143 (2013)","journal-title":"Australas. J. Comb."},{"issue":"6","key":"1873_CR169","first-page":"1","volume":"43","author":"F Li","year":"2008","unstructured":"Li, F., Geng, J., Li, S., Liang, F.: A partition of bipartite graphs with 4-cycle and 8-cycle. J. Shandong Univ. (Nat. Sci.) 43(6), 1\u20134 (2008)","journal-title":"J. Shandong Univ. (Nat. Sci.)"},{"key":"1873_CR170","first-page":"277","volume":"42","author":"J Li","year":"2005","unstructured":"Li, J., Steiner, G.: Partitioning a graph into vertex-disjoint paths. Studia Sci. Math. Hung. 42, 277\u2013294 (2005)","journal-title":"Studia Sci. Math. Hung."},{"key":"1873_CR171","first-page":"161","volume":"81","author":"J Li","year":"2006","unstructured":"Li, J., Steiner, G.: Partitioning a bipartite graph into vertex-disjoint paths. Ars Comb. 81, 161\u2013173 (2006)","journal-title":"Ars Comb."},{"key":"1873_CR172","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0166-218X(00)00380-2","volume":"113","author":"X Li","year":"2001","unstructured":"Li, X., Wei, B., Yang, F.: A degree condition of 2-factors in bipartite graphs. Discrete Appl. Math. 113, 311\u2013318 (2001)","journal-title":"Discrete Appl. Math."},{"key":"1873_CR173","first-page":"173","volume":"73","author":"X Li","year":"2004","unstructured":"Li, X., Wei, B., Yang, F.: Independent cycles in a bipartite graph. Ars Comb. 73, 173\u2013186 (2004)","journal-title":"Ars Comb."},{"key":"1873_CR174","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1137\/080715792","volume":"23","author":"N Lichiardopol","year":"2009","unstructured":"Lichiardopol, N., P\u00f3r, At, Sereni, J.S.: A step toward the Bermond-Thomassen conjecture about disjoint cycles in digraphs. SIAM J. Discrete Math 23, 979\u2013992 (2009)","journal-title":"SIAM J. Discrete Math"},{"key":"1873_CR175","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1016\/j.disc.2015.10.021","volume":"339","author":"H-S Lim","year":"2016","unstructured":"Lim, H.-S., Kim, H.-C., Park, J.-H.: Ore-type degree conditions for disjoint path covers in simple graphs. Discrete Math. 339, 770\u2013779 (2016)","journal-title":"Discrete Math."},{"key":"1873_CR176","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0012-365X(76)90031-5","volume":"15","author":"N Linial","year":"1976","unstructured":"Linial, N.: A lower bound for the circumference of a graph. Discrete Math. 15, 297\u2013300 (1976)","journal-title":"Discrete Math."},{"key":"1873_CR177","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1007\/s11425-014-4915-y","volume":"58","author":"M Liu","year":"2015","unstructured":"Liu, M., Xu, B.: Bipartition of graph under degree constrains. Sci. China Math. 58, 869\u2013874 (2015)","journal-title":"Sci. China Math."},{"key":"1873_CR178","first-page":"289","volume":"16","author":"L Lov\u00e1sz","year":"1965","unstructured":"Lov\u00e1sz, L.: On graphs not containing independent circuits. Mat. Lapok (N.S.) 16, 289\u2013299 (1965). (in Hungarian, English summary)","journal-title":"Mat. Lapok (N.S.)"},{"key":"1873_CR179","unstructured":"Lov\u00e1sz, L.: Problem 4. In: Fiedler, M. (ed.) Recent advances in graph theory. p. 542, Academia, Prague, (1975)"},{"key":"1873_CR180","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01896190","volume":"30","author":"L Lov\u00e1sz","year":"1977","unstructured":"Lov\u00e1sz, L.: A homology theory for spanning trees of a graph. Acta Math. Acad. Sci. Hung. 30, 241\u2013251 (1977)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"1873_CR181","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0095-8956(80)90066-0","volume":"28","author":"L Lov\u00e1sz","year":"1980","unstructured":"Lov\u00e1sz, L.: Matroid matching and some applications. J. Comb. Theory Ser. B 28, 208\u2013236 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR182","volume-title":"Combinatorial problems and exercises","author":"L Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz, L.: Combinatorial problems and exercises. North-Holland Publishing Co., Amsterdam (1993)"},{"key":"1873_CR183","unstructured":"Ma, F., Yan, J.: The confirmation of a conjecture on disjoint cycles in a graph. arXiv:1707.02390"},{"key":"1873_CR184","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BF02993903","volume":"37","author":"W Marder","year":"1972","unstructured":"Marder, W.: Existenz $$n$$-fach zusammenh\u00e4ngender Teilgraphen in Graphen gen\u00fcgend grosser Kantendichte. Abh. Math. Sem. Univ. Hambg. 37, 86\u201397 (1972)","journal-title":"Abh. Math. Sem. Univ. Hambg."},{"key":"1873_CR185","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/BF01226465","volume":"31","author":"W Mader","year":"1978","unstructured":"Mader, W.: \u00dcher die Maximalzahl kreuzungsfreier $$H$$-Wege. Arch. Math. (Basel) 31, 310\u2013318 (1978)","journal-title":"Arch. Math. (Basel)"},{"key":"1873_CR186","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/jgt.20437","volume":"64","author":"C Magnant","year":"2010","unstructured":"Magnant, C., Martin, D.: An asymptotic version of a conjecture by Enomoto and Ota. J. Graph Theory 64, 37\u201351 (2010)","journal-title":"J. Graph Theory"},{"key":"1873_CR187","first-page":"135","volume":"3","author":"C Magnant","year":"2012","unstructured":"Magnant, C., Ozeki, K.: Partitioning graphs into paths or cycles of prescribed lengths. J. Comb. 3, 135\u2013161 (2012)","journal-title":"J. Comb."},{"key":"1873_CR188","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.jctb.2017.05.004","volume":"127","author":"RR Martin","year":"2017","unstructured":"Martin, R.R., Skokan, J.: Asymptotic multipartite version of the Alon-Yuster theorem. J. Comb. Theory Ser. B 127, 32\u201352 (2017)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR189","doi-asserted-by":"crossref","first-page":"179","DOI":"10.55937\/sut\/1159987024","volume":"41","author":"R Matsubara","year":"2005","unstructured":"Matsubara, R., Matsumura, H.: Vertex disjoint cycles containing specified paths of order 3 in a bipartite graph. SUT J. Math. 41, 179\u2013195 (2005)","journal-title":"SUT J. Math."},{"key":"1873_CR190","doi-asserted-by":"publisher","first-page":"97","DOI":"10.7151\/dmgt.1394","volume":"28","author":"R Matsubara","year":"2008","unstructured":"Matsubara, R., Matsumura, H.: Partition of a graph into cycles containing a specified linear forest. Discuss. Math. Graph Theory 28, 97\u2013107 (2008)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1873_CR191","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.disc.2016.07.015","volume":"340","author":"R Matsubara","year":"2017","unstructured":"Matsubara, R., Matsumura, H., Tsugaki, M., Yamashita, T.: Degree sum conditions for path-factors with specified end vertices in bipartite graphs. Discrete Math. 340, 87\u201395 (2017)","journal-title":"Discrete Math."},{"key":"1873_CR192","first-page":"201","volume":"20","author":"R Matsubara","year":"2005","unstructured":"Matsubara, R., Sakai, T.: Cycles and degenerate cycles through specified vertices. Far East J. Appl. Math. 20, 201\u2013208 (2005)","journal-title":"Far East J. Appl. Math."},{"key":"1873_CR193","doi-asserted-by":"publisher","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 edges in a bipartite graph. Discrete Math. 297, 78\u201390 (2005)","journal-title":"Discrete Math."},{"key":"1873_CR194","first-page":"147","volume":"80","author":"H Matsumura","year":"2006","unstructured":"Matsumura, H.: Vertex-disjoint short cycles containing specified edges in a graph. Ars Comb. 80, 147\u2013152 (2006)","journal-title":"Ars Comb."},{"key":"1873_CR195","doi-asserted-by":"publisher","first-page":"95","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"Karl Menger","year":"1927","unstructured":"Menger, Karl: Zur allegeminen Kurventheorie. Fundam. Math. 10, 95\u2013115 (1927)","journal-title":"Fundam. Math."},{"key":"1873_CR196","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s00373-016-1749-0","volume":"33","author":"T Molla","year":"2017","unstructured":"Molla, T., Santana, M., Yeager, E.: A refinement of theorems of vertex-disjoint chorded cycles. Graphs Comb. 33, 181\u2013201 (2017)","journal-title":"Graphs Comb."},{"key":"1873_CR197","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF02759704","volume":"1","author":"JW Moon","year":"1963","unstructured":"Moon, J.W., Moser, L.: On hamiltonian bipartite graphs. Isr. J. Math. 1, 163\u2013165 (1963)","journal-title":"Isr. J. Math."},{"key":"1873_CR198","first-page":"75","volume":"31","author":"C Nara","year":"1980","unstructured":"Nara, C.: On sufficient conditions for a graph to be hamiltonian. Nat. Sci. Rep. Ochanomizu Univ. 31, 75\u201380 (1980)","journal-title":"Nat. Sci. Rep. Ochanomizu Univ."},{"key":"1873_CR199","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/BF01787816","volume":"11","author":"T Niessen","year":"1995","unstructured":"Niessen, T.: Minimum degree, independence number and regular factors. Graphs Comb. 11, 376\u2013378 (1995)","journal-title":"Graphs Comb."},{"key":"1873_CR200","doi-asserted-by":"publisher","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":"1873_CR201","first-page":"21","volume":"42","author":"O Ore","year":"1963","unstructured":"Ore, O.: Hamilton connected graphs. J. Math. Pures Appl. 42, 21\u201327 (1963)","journal-title":"J. Math. Pures Appl."},{"key":"1873_CR202","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1016\/j.jctb.2012.05.004","volume":"102","author":"M Pontecorvi","year":"2012","unstructured":"Pontecorvi, M., Wollan, P.: Disjoint cycles intersecting a set of vertices. J. Comb. Theory Ser. B 102, 1134\u20131141 (2012)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR203","first-page":"254","volume":"12","author":"L P\u00f3sa","year":"1961","unstructured":"P\u00f3sa, L.: Problem no. 127 (Hungarian). Mat. Lapok 12, 254 (1961)","journal-title":"Mat. Lapok"},{"key":"1873_CR204","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1016\/j.disc.2011.10.012","volume":"312","author":"S Qiao","year":"2012","unstructured":"Qiao, S.: Neighborhood unions and disjoint chorded cycles in graphs. Discrete Math. 312, 891\u2013897 (2012)","journal-title":"Discrete Math."},{"key":"1873_CR205","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.orl.2010.09.007","volume":"38","author":"S Qiao","year":"2010","unstructured":"Qiao, S., Zhang, S.: Vertex-disjoint chorded cycles in a graph. Oper. Res. Lett. 38, 564\u2013566 (2010)","journal-title":"Oper. Res. Lett."},{"key":"1873_CR206","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00373-011-1042-1","volume":"28","author":"S Qiao","year":"2012","unstructured":"Qiao, S., Zhang, S.: Spanning cyclic subdivisions of vertex-disjoint cycles and chorded cycles in graphs. Graphs Comb. 28, 277\u2013285 (2012)","journal-title":"Graphs Comb."},{"key":"1873_CR207","first-page":"75","volume":"14","author":"D Rautenbach","year":"2012","unstructured":"Rautenbach, D., Regen, F.: Graphs with many vertex-disjoint cycles. Discrete Math. Theor. Comput. Sci. 14, 75\u201382 (2012)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"1873_CR208","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1017\/S0963548315000073","volume":"25","author":"BA Reed","year":"2016","unstructured":"Reed, B.A., Wood, D.R.: Forcing a sparse minor. Comb. Prob. Comput. 25, 300\u2013322 (2016)","journal-title":"Comb. Prob. Comput."},{"key":"1873_CR209","doi-asserted-by":"crossref","unstructured":"Saito, A.: Chv\u00e1tal and Erd\u0151s Theorem: Old theorem with new aspects, Computational Geometry and Graph Theory, Lecture Notes in Comput. Sci. 4535, Springer, Berlin, 191\u2013200 (2008)","DOI":"10.1007\/978-3-540-89550-3_21"},{"key":"1873_CR210","doi-asserted-by":"publisher","first-page":"1962","DOI":"10.1016\/j.disc.2007.04.049","volume":"308","author":"G S\u00e1rk\u00f6zy","year":"2008","unstructured":"S\u00e1rk\u00f6zy, G.: On 2-factors with $$k$$ components. Discrete Math. 308, 1962\u20131972 (2008)","journal-title":"Discrete Math."},{"key":"1873_CR211","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0095-8956(78)90005-9","volume":"25","author":"N Sauer","year":"1978","unstructured":"Sauer, N., Spencer, J.: Edge disjoint placement of graphs. J. Comb. Theory Ser. B 25, 295\u2013302 (1978)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR212","first-page":"687","volume-title":"Graph theory and its applications to algorithms and computer science","author":"E Schmeichel","year":"1985","unstructured":"Schmeichel, E., Hayes, D.: Some extensions of Ore\u2019s theorem. In: Alavi, Y. (ed.) Graph theory and its applications to algorithms and computer science, pp. 687\u2013695. Wiley, New York (1985)"},{"key":"1873_CR213","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1006\/jctb.2000.2029","volume":"82","author":"A Schrijver","year":"2001","unstructured":"Schrijver, A.: A short proof of Mader\u2019s $$\\cal{S}$$-paths theorem. J. Comb. Theory Ser. B 82, 319\u2013321 (2001)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR214","unstructured":"Seymour, P.: Problem section. In: McDonough, T.P., Mavron, V.C. (eds.) Combinatorics. In: Proceedings of the British Combinatorial Conference 1973, Cambridge University Press, Cambridge. 201\u2013202 (1974)"},{"key":"1873_CR215","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1002\/jgt.3190160310","volume":"16","author":"RH Shi","year":"1992","unstructured":"Shi, R.H.: 2-neighborhoods and hamiltonian conditions. J. Graph Theory 16, 267\u2013271 (1992)","journal-title":"J. Graph Theory"},{"key":"1873_CR216","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1002\/(SICI)1097-0118(199611)23:3<321::AID-JGT12>3.0.CO;2-H","volume":"23","author":"M Stiebitz","year":"1996","unstructured":"Stiebitz, M.: Decomposing graphs under degree constraints. J. Graph Theory 23, 321\u2013324 (1996)","journal-title":"J. Graph Theory"},{"key":"1873_CR217","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.ejc.2004.02.013","volume":"26","author":"R Thomas","year":"2005","unstructured":"Thomas, R., Wollan, P.: An improved linear edge bound for graph linkages. Eur. J. Combin. 26, 309\u2013324 (2005)","journal-title":"Eur. J. Combin."},{"key":"1873_CR218","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1002\/jgt.3190050403","volume":"5","author":"C Thomassen","year":"1981","unstructured":"Thomassen, C.: Nonseparating cycles in $$k$$-connected graphs. J. Graph Theory 5, 351\u2013354 (1981)","journal-title":"J. Graph Theory"},{"key":"1873_CR219","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BF02579195","volume":"3","author":"C Thomassen","year":"1983","unstructured":"Thomassen, C.: Disjoint cycles in digraphs. Combinatorica 3, 393\u2013396 (1983)","journal-title":"Combinatorica"},{"key":"1873_CR220","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0095-8956(83)90067-9","volume":"31","author":"C Thomassen","year":"1983","unstructured":"Thomassen, C.: Girth in graphs. J. Comb. Theory Ser. B 31, 129\u2013141 (1983)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR221","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/jgt.3190070204","volume":"7","author":"C Thomassen","year":"1983","unstructured":"Thomassen, C.: Graph decomposition with constraints on the connectivity and minimum degree. J. Graph Theory 7, 165\u2013167 (1983)","journal-title":"J. Graph Theory"},{"key":"1873_CR222","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/jgt.3190070215","volume":"7","author":"C Thomassen","year":"1983","unstructured":"Thomassen, C.: Graph decomposition with applications to subdivisions and path systems modulo $$k$$. J. Graph Theory 7, 261\u2013271 (1983)","journal-title":"J. Graph Theory"},{"key":"1873_CR223","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/jgt.3190120111","volume":"12","author":"C Thomassen","year":"1988","unstructured":"Thomassen, C.: On the presence of disjoint subgraphs of a specified type. J. Graph Theory 12, 101\u2013111 (1988)","journal-title":"J. Graph Theory"},{"key":"1873_CR224","unstructured":"Thomassen, C.: Paths, circuits and subdivisions. In: Beineke, L.W., Wilson, R.J. (eds.) Selected Topics in Graph Theory III, pp. 97\u2013131. Academic Press, New York (1988)"},{"key":"1873_CR225","doi-asserted-by":"publisher","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"WT Tutte","year":"1952","unstructured":"Tutte, W.T.: The factors of graphs. Can. J. Math. 4, 314\u2013328 (1952)","journal-title":"Can. J. Math."},{"key":"1873_CR226","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0095-8956(02)00012-6","volume":"88","author":"J Verstr\u00e4ete","year":"2003","unstructured":"Verstr\u00e4ete, J.: Vertex-disjoint cycles of the same length. J. Comb. Theory Ser. B 88, 45\u201352 (2003)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1873_CR227","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF02986677","volume":"10","author":"H Wang","year":"1994","unstructured":"Wang, H.: Independent cycles with limited size in a graph. Graphs Comb. 10, 271\u2013281 (1994)","journal-title":"Graphs Comb."},{"key":"1873_CR228","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/jgt.3190200209","volume":"20","author":"H Wang","year":"1995","unstructured":"Wang, H.: Covering a graph with cycles. J. Graph Theory 20, 203\u2013211 (1995)","journal-title":"J. Graph Theory"},{"key":"1873_CR229","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BF01787818","volume":"11","author":"H Wang","year":"1995","unstructured":"Wang, H.: Two vertex-disjoint cycles in a graph. Graphs Comb. 11, 389\u2013396 (1995)","journal-title":"Graphs Comb."},{"key":"1873_CR230","doi-asserted-by":"publisher","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":"1873_CR231","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/(SICI)1097-0118(199710)26:2<105::AID-JGT5>3.0.CO;2-W","volume":"26","author":"H Wang","year":"1997","unstructured":"Wang, H.: Covering a graph with cycles passing through given edges. J. Graph Theory 26, 105\u2013109 (1997)","journal-title":"J. Graph Theory"},{"key":"1873_CR232","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0012-365X(97)00236-7","volume":"187","author":"H Wang","year":"1998","unstructured":"Wang, H.: Vertex-disjoint hexagons with chords in a bipartite graph. Discrete Math. 187, 221\u2013231 (1998)","journal-title":"Discrete Math."},{"key":"1873_CR233","doi-asserted-by":"publisher","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. Discrete Math. 205, 183\u2013190 (1999)","journal-title":"Discrete Math."},{"key":"1873_CR234","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/(SICI)1097-0118(199906)31:2<101::AID-JGT3>3.0.CO;2-5","volume":"31","author":"H Wang","year":"1999","unstructured":"Wang, H.: On 2-factors of a bipartite graph. J. Graph Theory 31, 101\u2013106 (1999)","journal-title":"J. Graph Theory"},{"key":"1873_CR235","doi-asserted-by":"publisher","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":"1873_CR236","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s003730050069","volume":"15","author":"H Wang","year":"1999","unstructured":"Wang, H.: On vertex-disjoint complete bipartite subgraphs in a bipartite graph. Graphs Comb. 15, 353\u2013364 (1999)","journal-title":"Graphs Comb."},{"key":"1873_CR237","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s003730070017","volume":"16","author":"H Wang","year":"2000","unstructured":"Wang, H.: Large vertex-disjoint cycles in a bipartite graph. Graphs Comb. 16, 359\u2013366 (2000)","journal-title":"Graphs Comb."},{"key":"1873_CR238","first-page":"301","volume":"58","author":"H Wang","year":"2001","unstructured":"Wang, H.: On quadrilaterals and cycle covers in a bipartite graph. Ars Comb. 58, 301\u2013311 (2001)","journal-title":"Ars Comb."},{"key":"1873_CR239","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s00493-005-0021-7","volume":"25","author":"H Wang","year":"2005","unstructured":"Wang, H.: Maximal total length of k disjoint cycles in bipartite graphs. Combinatorica 25, 367\u2013377 (2005)","journal-title":"Combinatorica"},{"key":"1873_CR240","doi-asserted-by":"publisher","first-page":"543","DOI":"10.2478\/s11533-008-0048-2","volume":"6","author":"H Wang","year":"2008","unstructured":"Wang, H.: Disjoint triangles and quadrilaterals in a graph. Cent. Eur. J. Math. 6, 543\u2013558 (2008)","journal-title":"Cent. Eur. J. Math."},{"key":"1873_CR241","doi-asserted-by":"publisher","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":"1873_CR242","first-page":"59","volume":"54","author":"H Wang","year":"2012","unstructured":"Wang, H.: An extension of the Corr\u00e1di-Hajnal theorem. Australas. J. Comb. 54, 59\u201384 (2012)","journal-title":"Australas. J. Comb."},{"key":"1873_CR243","doi-asserted-by":"publisher","first-page":"221","DOI":"10.7151\/dmgt.1605","volume":"32","author":"H Wang","year":"2012","unstructured":"Wang, H.: Disjoint 5-cycles in a graph. Discuss. Math. Graph Theory 32, 221\u2013242 (2012)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1873_CR244","doi-asserted-by":"publisher","first-page":"1983","DOI":"10.1007\/s11425-012-4539-z","volume":"56","author":"H Wang","year":"2013","unstructured":"Wang, H.: Disjoint long cycles in a graph. Sci. China Math. 56, 1983\u20131998 (2013)","journal-title":"Sci. China Math."},{"key":"1873_CR245","doi-asserted-by":"publisher","first-page":"919","DOI":"10.4134\/JKMS.2014.51.5.919","volume":"51","author":"H Wang","year":"2014","unstructured":"Wang, H.: Disjoint cycles with prescribed lengths and independent edges in graphs. J. Korean Math. Soc. 51, 919\u2013940 (2014)","journal-title":"J. Korean Math. Soc."},{"key":"1873_CR246","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/jgt.21807","volume":"78","author":"H Wang","year":"2015","unstructured":"Wang, H.: Partial degree conditions and cycle coverings. J. Graph Theory 78, 295\u2013304 (2015)","journal-title":"J. Graph Theory"},{"key":"1873_CR247","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1112\/plms\/s3-24.4.739","volume":"24","author":"DR Woodall","year":"1972","unstructured":"Woodall, D.R.: Sufficient conditions for circuits in graphs. Proc. Lond. Math. Soc. 24, 739\u2013755 (1972)","journal-title":"Proc. Lond. Math. Soc."},{"key":"1873_CR248","doi-asserted-by":"publisher","first-page":"6584","DOI":"10.1016\/j.disc.2007.10.048","volume":"308","author":"T Yamashita","year":"2008","unstructured":"Yamashita, T.: On degree sum conditions for long cycles and cycles through specified vertices. Discrete Math. 308, 6584\u20136587 (2008)","journal-title":"Discrete Math."},{"key":"1873_CR249","doi-asserted-by":"publisher","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":"1873_CR250","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1007\/s11425-009-0012-z","volume":"52","author":"J Yan","year":"2009","unstructured":"Yan, J., Gao, Y.: On Enomoto\u2019s problems in a bipartite graph. Sci. China Ser. A 52, 1947\u20131954 (2009)","journal-title":"Sci. China Ser. A"},{"key":"1873_CR251","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1007\/s10114-005-0666-6","volume":"22","author":"J Yan","year":"2006","unstructured":"Yan, J., Liu, G.Z.: 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":"1873_CR252","first-page":"133","volume":"82","author":"J Yan","year":"2007","unstructured":"Yan, J., Liu, G.: On 2-factors with quadrilaterals containing specified vertices in a bipartite graph. Ars Comb. 82, 133\u2013144 (2007)","journal-title":"Ars Comb."},{"key":"1873_CR253","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1016\/j.disc.2007.11.072","volume":"309","author":"J Yan","year":"2009","unstructured":"Yan, J., Liu, G.Z.: On 2-factors with cycles containing specified edges in a bipartite graph. Discrete Math. 309, 1112\u20131117 (2009)","journal-title":"Discrete Math."},{"key":"1873_CR254","doi-asserted-by":"publisher","unstructured":"Yan, J., Zhang, S., Cai, J.: Fan-type condition on disjoint cycles in a graph. Discrete Math. https:\/\/doi.org\/10.1016\/j.disc.2017.09.027","DOI":"10.1016\/j.disc.2017.09.027"},{"key":"1873_CR255","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.20627","volume":"71","author":"R Zamani","year":"2012","unstructured":"Zamani, R., West, D.B.: Spanning cycles through specified edges in bipartite graphs. J. Graph Theory 71, 1\u201317 (2012)","journal-title":"J. Graph Theory"},{"key":"1873_CR256","first-page":"341","volume":"86","author":"X Zhang","year":"2011","unstructured":"Zhang, X., Wu, J.-J., Yan, J.: Degree conditions for the partition of a graph into triangles and quadrilaterals. Util. Math. 86, 341\u2013346 (2011)","journal-title":"Util. Math."},{"key":"1873_CR257","doi-asserted-by":"publisher","first-page":"2171","DOI":"10.1007\/s00373-016-1689-8","volume":"32","author":"S Zhang","year":"2016","unstructured":"Zhang, S., Yan, J., Jiang, S.: Vertex-disjoint cycles containing specified vertices in a bipartite graph. Graphs Comb. 32, 2171\u20132181 (2016)","journal-title":"Graphs Comb."},{"key":"1873_CR258","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1137\/110837188","volume":"27","author":"ZB Zhang","year":"2013","unstructured":"Zhang, Z.B., Zhang, X., Wen, X.: Directed hamilton cycles in digraphs and matching alternating hamilton cycles in bipartite graphs. SIAM J. Discrete Math. 27, 274\u2013289 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"1873_CR259","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1137\/060665397","volume":"23","author":"Y Zhao","year":"2009","unstructured":"Zhao, Y.: Bipartite graph tiling. SIAM J. Discrete Math. 23, 888\u2013900 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"1873_CR260","first-page":"255","volume":"36","author":"Q Zou","year":"2013","unstructured":"Zou, Q., Chen, H., Li, G.: Vertex-disjoint cycles of order eight with chords in a bipartite graph. Bull. Malays. Math. Sci. Soc. (2) 36, 255\u2013262 (2013)","journal-title":"Bull. Malays. Math. Sci. Soc. (2)"},{"key":"1873_CR261","doi-asserted-by":"publisher","first-page":"1658","DOI":"10.1016\/j.disc.2011.03.029","volume":"311","author":"Q Zou","year":"2011","unstructured":"Zou, Q., Li, G., Dong, A.: Ore-type conditions for bipartite graphs containing hexagons. Discrete Math. 311, 1658\u20131665 (2011)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1873-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1873-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1873-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T18:30:10Z","timestamp":1693506610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1873-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":261,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["1873"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1873-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"2 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}