{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:42Z","timestamp":1740107142303,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"crossref","award":["2014\/18641-5","2015\/07869-8"],"award-info":[{"award-number":["2014\/18641-5","2015\/07869-8"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"name":"JSPS KAKENHI Grant","award":["JP16K17646"],"award-info":[{"award-number":["JP16K17646"]}]},{"name":"Research grant of Senshu University"},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2017R1D1A1B03031758"],"award-info":[{"award-number":["NRF-2017R1D1A1B03031758"]}],"id":[{"id":"10.13039\/501100003725","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":[[2017,9]]},"DOI":"10.1007\/s00373-017-1847-7","type":"journal-article","created":{"date-parts":[[2017,9,12]],"date-time":"2017-09-12T11:17:15Z","timestamp":1505215035000},"page":"1321-1345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Forbidden Pairs and the Existence of a Spanning Halin Subgraph"],"prefix":"10.1007","volume":"33","author":[{"given":"Guantao","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suil","family":"O","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songling","family":"Shan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shoichi","family":"Tsuchiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,12]]},"reference":[{"key":"1847_CR1","unstructured":"Bedrossian, P.: Forbidden subgraph and minimum degree conditions for Hamiltonicity. Ph.D. Thesis, Memphis State University (1991)"},{"key":"1847_CR2","unstructured":"Bondy, J.A.: Pancyclic graphs: recent results. In: Hajnal, A., Rado, R., S\u00f3s, V.T. (eds.) Infinite and finite sets, Colloq. Math. Soc. J\u00e1nos Bolyai, vol. 10, pp. 181\u2013187. Kiado, Budapest, North-Holland, Amsterdam (1975)"},{"key":"1847_CR3","first-page":"93","volume":"58","author":"CA Barefoot","year":"1987","unstructured":"Barefoot, C.A.: Hamiltonian connectivity of the Halin graphs. Congr. Numer. 58, 93\u2013102 (1987)","journal-title":"Congr. Numer."},{"key":"1847_CR4","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1002\/jgt.10034","volume":"40","author":"HJ Broersma","year":"2002","unstructured":"Broersma, H.J., Faudree, R.J., Huck, A., Trommel, H., Veldman, H.J.: Forbidden subgraphs that imply Hamiltonian-connectedness. J. Graph Theory 40, 104\u2013119 (2002)","journal-title":"J. Graph Theory"},{"key":"1847_CR5","first-page":"65","volume":"89","author":"RB Borie","year":"1992","unstructured":"Borie, R.B., Horton, S.B., Parker, R.G.: On some results pertaining to Halin graphs. Congr. Numer. 89, 65\u201387 (1992)","journal-title":"Congr. Numer."},{"key":"1847_CR6","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1002\/jgt.3190090311","volume":"9","author":"JA Bondy","year":"1985","unstructured":"Bondy, J.A., Lov\u00e1sz, L.: Lengths of cycles in Halin graphs. J. Graph Theory 9, 397\u2013410 (1985)","journal-title":"J. Graph Theory"},{"key":"1847_CR7","doi-asserted-by":"crossref","first-page":"1423","DOI":"10.1137\/140971610","volume":"29","author":"G Chen","year":"2015","unstructured":"Chen, G., Enomoto, H., Ozeki, K., Tsuchiya, S.: Plane triangulations without spanning Halin subgraphs: counterexamples of Lov\u00e1sz\u2013Plummer conjecture on Halin graphs. SIAM J. Discrete Math. 29, 1423\u20131426 (2015)","journal-title":"SIAM J. Discrete Math."},{"key":"1847_CR8","doi-asserted-by":"crossref","unstructured":"Cornu\u00e9jols, G., Naddef, D., Pulleyblank, W.R.: Halin graphs and the travelling salesman prolblem. Math. Program. 26, 287\u2013294 (1983)","DOI":"10.1007\/BF02591867"},{"key":"1847_CR9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.dam.2014.12.023","volume":"185","author":"J Diemunsch","year":"2015","unstructured":"Diemunsch, J., Furuya, M., Sharifzadeh, M., Tsuchiya, S., Wang, D., Wise, J., Yeager, E.: A characterization of \n                        $$P_5$$\n                        \n                            \n                                            \n                                \n                                    P\n                                    5\n                                \n                            \n                        \n                    -free graphs with a homeomorphically irreducible spanning tree. Discrete Appl. Math. 185, 71\u201378 (2015)","journal-title":"Discrete Appl. Math."},{"key":"1847_CR10","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1002\/jgt.21645","volume":"72","author":"JR Faudree","year":"2013","unstructured":"Faudree, J.R., Faudree, R.J., Ryj\u00e1\u010dek, Z., Vr\u00e1na, P.: On forbidden pairs implying Hamilton-connectedness. J. Graph Theory 72, 327\u2013345 (2013)","journal-title":"J. Graph Theory"},{"key":"1847_CR11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0012-365X(96)00147-1","volume":"173","author":"RJ Faudree","year":"1997","unstructured":"Faudree, R.J., Gould, R.J.: Characterizing forbidden pairs for Hamiltonian properties. Discrete Math. 173, 45\u201360 (1997)","journal-title":"Discrete Math."},{"key":"1847_CR12","unstructured":"Halin, R.: Studies on minimally \n                        $$n$$\n                        \n                            \n                                            \n                                n\n                            \n                        \n                    -connected graphs. In: Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969), pp. 129\u2013136"},{"key":"1847_CR13","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1112\/plms\/s3-30.2.160","volume":"30","author":"L Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: On a family of planar bicritical graphs. Proc. Lond. Math. Soc. (3) 30, 160\u2013176 (1975)","journal-title":"Proc. Lond. Math. Soc. (3)"},{"key":"1847_CR14","first-page":"179","volume":"27","author":"M Skowro\u0144ska","year":"1985","unstructured":"Skowro\u0144ska, M.: The pancyclicity of Halin graphs and their exterior contractions. Ann. Discrete Math. 27, 179\u2013194 (1985)","journal-title":"Ann. Discrete Math."},{"key":"1847_CR15","unstructured":"Skupie\u0144, Z.: Crowned trees and planar highly Hamiltonian graphs. In: Contemporary Methods in Graph Theory, pp. 537\u2013555. Wissenschaftsverlag, Mannheim (1990)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1847-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1847-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1847-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,19]],"date-time":"2017-10-19T15:39:11Z","timestamp":1508427551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1847-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["1847"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1847-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2017,9]]}}}