{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T19:32:24Z","timestamp":1648927944243},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,3,7]],"date-time":"2015-03-07T00:00:00Z","timestamp":1425686400000},"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":[[2016,1]]},"DOI":"10.1007\/s00373-015-1559-9","type":"journal-article","created":{"date-parts":[[2015,3,6]],"date-time":"2015-03-06T07:54:57Z","timestamp":1425628497000},"page":"311-321","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hamilton Circuits and Essential Girth of Claw Free Graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Zhengke","family":"Miao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cun-Quan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,7]]},"reference":[{"key":"1559_CR1","unstructured":"Bedrossian, P.: Forbidden subgraph and minimum degree conditions for hamiltonicity. Ph.D. thesis, Memphis State University (1991)"},{"key":"1559_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/jgt.1008","volume":"37","author":"HJ Broersma","year":"2001","unstructured":"Broersma, H.J., Kriesell, M., Ryj\u00e1\u010dek, Z.: On factors of 4-connected claw-free graphs. J. Graph Theory 37, 125\u2013136 (2001)","journal-title":"J. Graph Theory"},{"key":"1559_CR3","first-page":"181","volume-title":"Contemporary Methods in Graph Theory","author":"HJ Broersma","year":"1990","unstructured":"Broersma, H.J., Veldman, H.J.: Restrictions on induced subgraphs ensuring Hamiltonicity or pancyclicity of $$K_{1,3}$$ K 1 , 3 -free graphs. In: Bondendiek, R. (ed.) Contemporary Methods in Graph Theory, pp. 181\u2013194. BI-Wiss-Verlag, Mannheim (1990)"},{"key":"1559_CR4","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0012-365X(01)00327-2","volume":"251","author":"J Brousek","year":"2002","unstructured":"Brousek, J., Faudree, R.J., Ryj\u00e1\u010dek, Z.: A note on hamiltonicity of generalized net-free graphs of large diameter. Discrete Math. 251, 77\u201385 (2002)","journal-title":"Discrete Math."},{"key":"1559_CR5","unstructured":"Chiba S., Fujisawa, J.: Hamiltonicity of 3-connected generalized bull-free line graphs. http:\/\/www.rs.kagu.tus.ac.jp\/chiba\/forbidden-subgraph(B_%7Bs,t%7D).pdf"},{"key":"1559_CR6","volume-title":"Forbidden Subgraphs and the Hamiltonian Theme, The Theory and Applications of Graphs, Kalamazoo, Michigan, 1980","author":"D Duffus","year":"1981","unstructured":"Duffus, D., Gould, R.J., Jacobson, M.S.: Forbidden Subgraphs and the Hamiltonian Theme, The Theory and Applications of Graphs, Kalamazoo, Michigan, 1980. Wiley, New York (1981)"},{"key":"1559_CR7","first-page":"13","volume":"109","author":"RJ Faudree","year":"1995","unstructured":"Faudree, R.J., Gould, R.J., Ryj\u00e1\u010dek, Z., Schiermejer, I.: Forbidden subgraphs and pancyclicity. Congr. Numer. 109, 13\u201332 (1995)","journal-title":"Congr. Numer."},{"key":"1559_CR8","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":"1559_CR9","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1002\/jgt.21663","volume":"73","author":"J Fujiwasa","year":"2013","unstructured":"Fujiwasa, J.: Forbidden Subgraphs for Hamiltonicity of 3-connected claw-free graphs. J. Graph Theory 73, 146\u2013160 (2013)","journal-title":"J. Graph Theory"},{"key":"1559_CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0012-365X(82)90216-3","volume":"42","author":"RJ Gould","year":"1982","unstructured":"Gould, R.J., Jacobson, M.S.: Forbidden subgraphs and hamiltonian properties of graphs. Discrete Math. 42, 189\u2013196 (1982)","journal-title":"Discrete Math."},{"key":"1559_CR11","doi-asserted-by":"crossref","first-page":"701","DOI":"10.4153\/CMB-1965-051-3","volume":"8","author":"F Haray","year":"1965","unstructured":"Haray, F., Nash-Williams, C.S.J.A.: On Eulerian and Hamiltonian graphs and line graphs. Can. Math. Bull. 8, 701\u2013710 (1965)","journal-title":"Can. Math. Bull."},{"key":"1559_CR12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1002\/jgt.20056","volume":"48","author":"T Kaiser","year":"2005","unstructured":"Kaiser, T., Li, M., Ryj\u00e1\u010dek, Z., Xiong, L.: Hourglass and Hamilton cycle in 4-connected claw-free graphs. J. Graph Theory 48, 267\u2013276 (2005)","journal-title":"J. Graph Theory"},{"key":"1559_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.20433","volume":"64","author":"H-J Lai","year":"2010","unstructured":"Lai, H.-J., Xiong, L., Yan, H., Yan, J.: Every $$3$$ 3 -connected claw-free $$Z_8$$ Z 8 -free graph is Hamiltonian. J. Graph Theory 64, 1\u201311 (2010)","journal-title":"J. Graph Theory"},{"key":"1559_CR14","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/jgt.3190080116","volume":"8","author":"HM Matthews","year":"1984","unstructured":"Matthews, H.M., Summer, D.P.: hamiltonian results in $$K_{1,3}$$ K 1 , 3 -free graphs. J. Graph Theory 8, 139\u2013146 (1984)","journal-title":"J. Graph Theory"},{"key":"1559_CR15","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1002\/jgt.20080","volume":"49","author":"Florian Pfender","year":"2005","unstructured":"Pfender, Florian: Hamiltonicity and forbidden subgraphs in 4-connected graphs. J. Graph Theory 49, 262\u2013272 (2005)","journal-title":"J. Graph Theory"},{"key":"1559_CR16","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1006\/jctb.1996.1732","volume":"70","author":"Z Ryj\u00e1\u010dek","year":"1997","unstructured":"Ryj\u00e1\u010dek, Z.: On a closure concept in claw-free graphs. J. Comb. Theory Ser. B 70, 217\u2013224 (1997)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1559-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1559-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1559-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:40Z","timestamp":1559055580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1559-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,7]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["1559"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1559-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,7]]}}}