{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T19:25:18Z","timestamp":1769109918549,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T00:00:00Z","timestamp":1538784000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00373-018-1952-2","type":"journal-article","created":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T04:44:09Z","timestamp":1538801049000},"page":"1671-1690","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Forbidden Subgraphs and Weak Locally Connected Graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Xia","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Houyuan","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liming","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,6]]},"reference":[{"key":"1952_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1002\/jgt.20541","volume":"68","author":"REL Aldred","year":"2011","unstructured":"Aldred, R.E.L., Egawa, Y., Fujisawa, J., Ota, K., Saito, A.: The existence of a 2-factor in \n                    \n                      \n                    \n                    $$K_{1, n}$$\n                    \n                      \n                        \n                          K\n                          \n                            1\n                            ,\n                            n\n                          \n                        \n                      \n                    \n                  - free graphs with large connectivity and large edge-connectivity. J. Graph Theory 68, 77\u201389 (2011)","journal-title":"J. Graph Theory"},{"key":"1952_CR2","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"J. A. Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New York (2008)"},{"key":"1952_CR3","doi-asserted-by":"publisher","first-page":"1696","DOI":"10.1016\/j.disc.2018.03.009","volume":"341","author":"R \u010cada","year":"2018","unstructured":"\u010cada, R., Ozeki, K., Xiong, L., Yoshimoto, K.: A pair of forbidden subgraphs and 2-connected supereulerian graphs. Discrete Math. 341, 1696\u20131707 (2018)","journal-title":"Discrete Math."},{"key":"1952_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/jgt.3190120105","volume":"12","author":"PA Catlin","year":"1988","unstructured":"Catlin, P.A.: A reduction method to find spanning eulerian subgraphs. J. Graph Theory 12, 29\u201344 (1988)","journal-title":"J. Graph Theory"},{"key":"1952_CR5","first-page":"233","volume":"58","author":"PA Catlin","year":"1988","unstructured":"Catlin, P.A.: Supereulerian graphs, collapsible graphs, and four-cycles. Congr Numerantium 58, 233\u2013246 (1988)","journal-title":"Congr Numerantium"},{"key":"1952_CR6","first-page":"271","volume":"48","author":"ZH Chen","year":"1998","unstructured":"Chen, Z.H., Lai, H.J.: Supereulerian graph and the Petersen graph, \n                    \n                      \n                    \n                    $$\\Pi $$\n                    \n                      \n                        \u03a0\n                      \n                    \n                  . Ars Comb. 48, 271\u2013282 (1998)","journal-title":"Ars Comb."},{"key":"1952_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0012-365X(96)00147-1","volume":"173","author":"R Faudree","year":"1997","unstructured":"Faudree, R., Gould, R.J.: Characterizating forbidden pairs for hamiltonian properties. Discrete Math. 173, 45\u201360 (1997)","journal-title":"Discrete Math."},{"key":"1952_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0012-365X(91)90302-I","volume":"94","author":"HJ Lai","year":"1991","unstructured":"Lai, H.J.: Graph whose edges are in small cycles. Discrete Math. 94, 11\u201322 (1991)","journal-title":"Discrete Math."},{"key":"1952_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0012-365X(94)00159-7","volume":"146","author":"HJ Lai","year":"1995","unstructured":"Lai, H.J.: Supereulerian graphs and excluded induced minors. Discrete Math. 146, 133\u2013143 (1995)","journal-title":"Discrete Math."},{"key":"1952_CR10","first-page":"191","volume":"94","author":"HJ Lai","year":"2010","unstructured":"Lai, H.J., Li, M.C., Shao, Y., Xiong, L.: Spanning eulerian subgraphs in \n                    \n                      \n                    \n                    $$N^2$$\n                    \n                      \n                        \n                          N\n                          2\n                        \n                      \n                    \n                  -locally connected claw-free graphs. Ars Comb. 94, 191\u2013199 (2010)","journal-title":"Ars Comb."},{"key":"1952_CR11","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1002\/jgt.20046","volume":"48","author":"HJ Lai","year":"2005","unstructured":"Lai, H.J., Shao, Y., Zhan, M.: Hamiltonian \n                    \n                      \n                    \n                    $$N_2$$\n                    \n                      \n                        \n                          N\n                          2\n                        \n                      \n                    \n                  -locally connected claw-free graphs. J. Graph Theory 48, 142\u2013146 (2005)","journal-title":"J. Graph Theory"},{"key":"1952_CR12","first-page":"369","volume":"8","author":"G Li","year":"1995","unstructured":"Li, G., Liu, Z.: On 2-factors in claw-free graphs. Syst. Sci. Math. Sci. 8, 369\u2013372 (1995)","journal-title":"Syst. Sci. Math. Sci."},{"key":"1952_CR13","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1016\/j.disc.2017.01.009","volume":"340","author":"S Lv","year":"2017","unstructured":"Lv, S., Xiong, L.: Forbidden pairs for spanning (closed) trails. Discrete Math. 340, 1012\u20131018 (2017)","journal-title":"Discrete Math."},{"key":"1952_CR14","doi-asserted-by":"publisher","first-page":"1192","DOI":"10.1016\/j.disc.2017.11.020","volume":"341","author":"S Lv","year":"2018","unstructured":"Lv, S., Xiong, L.: Erratum to \u201cForbidden pairs for spanning (closed) trails\u201d [Discrete Math. 340 (2017) 1012\u20131018]. Discrete Math. 341, 1192\u20131193 (2018)","journal-title":"Discrete Math."},{"key":"1952_CR15","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1002\/jgt.3190030405","volume":"3","author":"D Oberly","year":"1979","unstructured":"Oberly, D., Sumner, D.P.: Every connected, locally connected nontrivial graph with no induced claw is Hamiltonian. J. Graph Theory 3, 351\u2013356 (1979)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1952-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1952-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1952-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T19:14:19Z","timestamp":1570302859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1952-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,6]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1952"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1952-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,6]]},"assertion":[{"value":"22 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}