{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:59:04Z","timestamp":1760597944496,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T00:00:00Z","timestamp":1585872000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T00:00:00Z","timestamp":1585872000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003169","name":"South China Normal University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003169","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["201906755002"],"award-info":[{"award-number":["201906755002"]}],"id":[{"id":"10.13039\/501100004543","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":[[2020,7]]},"DOI":"10.1007\/s00373-020-02164-x","type":"journal-article","created":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T19:02:37Z","timestamp":1585940557000},"page":"1043-1058","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Hamiltonian Cycle Properties in k-Extendable Non-bipartite Graphs with High Connectivity"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2545-9929","authenticated-orcid":false,"given":"Zhiyong","family":"Gan","sequence":"first","affiliation":[]},{"given":"Dingjun","family":"Lou","sequence":"additional","affiliation":[]},{"given":"Yanping","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,3]]},"reference":[{"key":"2164_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Berlin (2008)"},{"issue":"2","key":"2164_CR2","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\u00f6s, P.: A note on Hamiltonian circuits. Discrete Math. 2(2), 111\u2013113 (1972)","journal-title":"Discrete Math."},{"issue":"1","key":"2164_CR3","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(1), 69\u201381 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"2164_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.7151\/dmgt.1022","volume":"16","author":"O Favaron","year":"1996","unstructured":"Favaron, O.: On $$k$$-factor-critical graphs. Discuss. Math. Graph Theory 16, 41\u201351 (1996)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2164_CR5","first-page":"135","volume":"8","author":"T Gallai","year":"1963","unstructured":"Gallai, T.: Neuer Beweis eines Tutte\u2019schen Satzes, Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 8, 135\u2013139 (1963)","journal-title":"Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"2164_CR6","first-page":"91","volume":"144","author":"Z Gan","year":"2019","unstructured":"Gan, Z., Lou, D.: Long cycles in $$n$$-extendable bipartite graphs. Ars Combin. 144, 91\u2013105 (2019)","journal-title":"Ars Combin."},{"key":"2164_CR7","unstructured":"Gan, Z., Lou, D.: Hamilton paths in $$n$$-extendable bipartite graphs. Ars Combin (accepted)"},{"key":"2164_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1002\/jgt.10050","volume":"40","author":"K Kawarabayashi","year":"2002","unstructured":"Kawarabayashi, K., Ota, K., Saito, A.: Hamiltonian cycles in $$n$$-extendable graphs. J. Graph Theory 40, 75\u201382 (2002)","journal-title":"J. Graph Theory"},{"key":"2164_CR9","first-page":"3","volume":"139","author":"Y Li","year":"2018","unstructured":"Li, Y., Lou, D.: Hamilton cycles in $$n$$-extendable bipartite graphs. Ars Combin. 139, 3\u201318 (2018)","journal-title":"Ars Combin."},{"key":"2164_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0166-218X(03)00198-7","volume":"136","author":"D Lou","year":"2004","unstructured":"Lou, D., Yu, Q.: Connectivity of $$k$$-extendable graphs with large $$k$$. Discrete Appl. Math. 136, 55\u201361 (2004)","journal-title":"Discrete Appl. Math."},{"key":"2164_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01889914","volume":"23","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: On the structure of factorizable graphs. Acta Math. Acad. Sci. Hungar. 23, 179\u2013195 (1972)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"2164_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0012-365X(95)00042-U","volume":"154","author":"P Maschlanka","year":"1996","unstructured":"Maschlanka, P., Volkmann, L.: Independence number in $$n$$-extendable graphs. Discrete Math. 154, 167\u2013178 (1996)","journal-title":"Discrete Math."},{"key":"2164_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0012-365X(80)90037-0","volume":"31","author":"MD Plummer","year":"1980","unstructured":"Plummer, M.D.: On $$n$$-extendable graphs. Discrete Math. 31, 201\u2013210 (1980)","journal-title":"Discrete Math."},{"key":"2164_CR14","first-page":"427","volume-title":"Recent Progress in Matching Extension, Building Bridges","author":"MD Plummer","year":"2008","unstructured":"Plummer, M.D.: Recent Progress in Matching Extension, Building Bridges, pp. 427\u2013454. Springer, Berlin (2008)"},{"key":"2164_CR15","first-page":"55","volume":"7","author":"Q Yu","year":"1993","unstructured":"Yu, Q.: Characterizations of various matchings in graphs. Australas. J. Combin. 7, 55\u201364 (1993)","journal-title":"Australas. J. Combin."},{"key":"2164_CR16","doi-asserted-by":"publisher","first-page":"3385","DOI":"10.1016\/j.disc.2008.08.001","volume":"309","author":"Z-B Zhang","year":"2009","unstructured":"Zhang, Z.-B., Li, Y., Lou, D.: $$M$$-alternating Hamilton paths and $$M$$-alternating Hamilton cycles. Discrete Math. 309, 3385\u20133392 (2009)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02164-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-020-02164-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02164-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,2]],"date-time":"2021-04-02T23:18:47Z","timestamp":1617405527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-020-02164-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,3]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["2164"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02164-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,4,3]]},"assertion":[{"value":"10 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}