{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:04:55Z","timestamp":1740107095778,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T00:00:00Z","timestamp":1600128000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T00:00:00Z","timestamp":1600128000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11601429"],"award-info":[{"award-number":["11601429"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["3102019ghjd003"],"award-info":[{"award-number":["3102019ghjd003"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s00373-020-02211-7","type":"journal-article","created":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T17:03:06Z","timestamp":1600189386000},"page":"1639-1653","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bipartite Independent Number and Hamilton-Biconnectedness of Bipartite Graphs"],"prefix":"10.1007","volume":"36","author":[{"given":"Binlong","family":"Li","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,15]]},"reference":[{"issue":"4","key":"2211_CR1","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1002\/jgt.3190200414","volume":"20","author":"D Amar","year":"1995","unstructured":"Amar, D., Favaron, O., Mago, P., Ordaz, O.: Biclosure and bistability in a balanced bipartite graph. J. Graph Theory 20(4), 513\u2013529 (1995)","journal-title":"J. Graph Theory"},{"key":"2211_CR2","first-page":"33","volume":"16","author":"P Ash","year":"1983","unstructured":"Ash, P.: Two sufficient conditions for the existence of Hamilton cycles in bipartite graphs. Ars Combin. 16, 33\u201337 (1983)","journal-title":"Ars Combin."},{"key":"2211_CR3","first-page":"564","volume-title":"Graph Theory, Combinatorics, Algorithms, and Applications","author":"KS Bagga","year":"1991","unstructured":"Bagga, K.S., Varma, B.N.: Bipartite graphs and degree conditions. In: Alavi, Y., Chung, F., Graham, R., Hsu, D., Siam, G. (eds.) Graph Theory, Combinatorics, Algorithms, and Applications, pp. 564\u2013573. Springer, New York (1991)"},{"key":"2211_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0012-365X(76)90078-9","volume":"15","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Chv\u00e1tal, V.: A method in graph theory. Discrete Math. 15, 111\u2013135 (1976)","journal-title":"Discrete Math."},{"key":"2211_CR5","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":"2211_CR6","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. (3) 2, 69\u201381 (1952)","journal-title":"Proc. Lond. Math. Soc. (3)"},{"key":"2211_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1137\/0406015","volume":"6","author":"O Favaron","year":"1993","unstructured":"Favaron, O., Mago, P., Maulino, C., Ordaz, O.: Hamiltonian properties of bipartite graphs and digraphs with bipartite independence number 2. SIAM J. Discrete Math. 6, 189\u2013196 (1993)","journal-title":"SIAM J. Discrete Math."},{"key":"2211_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0012-365X(93)90537-4","volume":"121","author":"O Favaron","year":"1993","unstructured":"Favaron, O., Mago, P., Ordaz, O.: On the bipartite independence number of a balanced bipartite graph. Discrete Math. 121, 55\u201363 (1993)","journal-title":"Discrete Math."},{"key":"2211_CR9","unstructured":"Fraisse, P.: $$D_\\lambda $$-cycles and Their Applications for Hamiltonian Graphs, Ph.D. thesis, Universit\u00e9 Paris-Sud, Paris, France, (1986)"},{"issue":"2","key":"2211_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1002\/jgt.3190150204","volume":"15","author":"RJ Gould","year":"1991","unstructured":"Gould, R.J.: Updating the hamiltonian problem\u2014a survey. J. Graph Theory 15(2), 121\u2013157 (1991)","journal-title":"J. Graph Theory"},{"issue":"2","key":"2211_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF02579378","volume":"5","author":"SC Locke","year":"1985","unstructured":"Locke, S.C.: A generalization of Dirac\u2019s Theorem. Combinatorica 5(2), 149\u2013159 (1985)","journal-title":"Combinatorica"},{"issue":"2","key":"2211_CR12","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01200758","volume":"15","author":"X Lu","year":"1995","unstructured":"Lu, X.: Hamiltonian cycles in bipartite graphs. Combinatorica 15(2), 247\u2013254 (1995)","journal-title":"Combinatorica"},{"key":"2211_CR13","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF02759704","volume":"1","author":"J Moon","year":"1963","unstructured":"Moon, J., Moser, L.: On Hamiltonian bipartite graphs. Israel J. Math. 1, 163\u2013165 (1963)","journal-title":"Israel J. Math."},{"key":"2211_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.2307\/2308928","volume":"67","author":"O Ore","year":"1960","unstructured":"Ore, O.: Note on hamiltonian circuits. Am. Math. Mon. 67, 55 (1960)","journal-title":"Am. Math. Mon."},{"key":"2211_CR15","unstructured":"Simmons, G.J.: Almost all $$n$$-dimensional rectangular lattices are hamilton-laceable, In: Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, Fla., pp. 649-661 (1978)"},{"key":"2211_CR16","first-page":"893","volume":"29","author":"GJ Simmons","year":"1980","unstructured":"Simmons, G.J.: Minimal Hamilton-laceable graphs. Congr. Numer. 29, 893\u2013900 (1980)","journal-title":"Congr. Numer."},{"issue":"4","key":"2211_CR17","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1002\/jgt.3190050410","volume":"5","author":"GJ Simmons","year":"1981","unstructured":"Simmons, G.J.: Maximal non-hamilton-laceable graphs. J. Graph Theory 5(4), 407\u2013415 (1981)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02211-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02211-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02211-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,15]],"date-time":"2021-09-15T02:53:48Z","timestamp":1631674428000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02211-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,15]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["2211"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02211-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,9,15]]},"assertion":[{"value":"14 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}