{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:52Z","timestamp":1740107152551,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,10,19]],"date-time":"2019-10-19T00:00:00Z","timestamp":1571443200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,19]],"date-time":"2019-10-19T00:00:00Z","timestamp":1571443200000},"content-version":"vor","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":[[2019,11]]},"DOI":"10.1007\/s00373-019-02108-0","type":"journal-article","created":{"date-parts":[[2019,10,19]],"date-time":"2019-10-19T18:24:55Z","timestamp":1571509495000},"page":"1459-1474","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Characterizing the Difference Between Graph Classes Defined by Forbidden Pairs Including the Claw"],"prefix":"10.1007","volume":"35","author":[{"given":"Guantao","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0991-6122","authenticated-orcid":false,"given":"Michitaka","family":"Furuya","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"}]},{"given":"Ping","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,19]]},"reference":[{"key":"2108_CR1","unstructured":"Bedrossian, P.: Forbidden subgraph and minimum degree conditions for hamiltonicity. Ph.D.\u00a0Thesis, Memphis State University (1991)"},{"key":"2108_CR2","first-page":"181","volume-title":"Restrictions on Induced Subgraphs Ensuring Hamiltonicity or Pancyclicity of $$K_{1,3}$$-Free Graphs. In Contemporary Methods in Graph Theory","author":"H Broersma","year":"1990","unstructured":"Broersma, H., Veldman, H.J.: Restrictions on Induced Subgraphs Ensuring Hamiltonicity or Pancyclicity of $$K_{1,3}$$-Free Graphs. In Contemporary Methods in Graph Theory, pp. 181\u2013194. Bibliographisches Inst, Mannheim (1990)"},{"key":"2108_CR3","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1007\/s00373-017-1847-7","volume":"33","author":"G Chen","year":"2017","unstructured":"Chen, G., Han, J., O, S., Shan, S., Tsuchiya, S.: Forbidden pairs and the existence of a spanning Halin subgraph. Graphs Combin. 33, 1321\u20131345 (2017)","journal-title":"Graphs Combin."},{"key":"2108_CR4","doi-asserted-by":"publisher","first-page":"1817","DOI":"10.1007\/s00373-016-1680-4","volume":"32","author":"CB Crane","year":"2016","unstructured":"Crane, C.B.: Hamiltonian type properties in claw-free $$P_{5}$$-free graphs. Graphs Combin. 32, 1817\u20131828 (2016)","journal-title":"Graphs Combin."},{"issue":"2","key":"2108_CR5","first-page":"185","volume":"72","author":"CB Crane","year":"2018","unstructured":"Crane, C.B.: Pancyclic type properties of claw-free $$P_{6}$$-free graphs. Australas. J. Combin. 72(2), 185\u2013200 (2018)","journal-title":"Australas. J. Combin."},{"key":"2108_CR6","volume-title":"Graph Theory (5th edition), Graduate Texts in Mathematics","author":"R Diestel","year":"2018","unstructured":"Diestel, R.: Graph Theory (5th edition), Graduate Texts in Mathematics, vol. 173. Springer, Berlin (2018)"},{"key":"2108_CR7","first-page":"297","volume-title":"Forbidden Subgraphs and the Hamiltonian Theme. In The Theory and Applications of Graphs","author":"D Duffus","year":"1981","unstructured":"Duffus, D., Jacobson, M.S., Gould, R.J.: Forbidden Subgraphs and the Hamiltonian Theme. In The Theory and Applications of Graphs, pp. 297\u2013316. Wiley, New York (1981)"},{"key":"2108_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00373-004-0576-x","volume":"20","author":"RJ Faudree","year":"2004","unstructured":"Faudree, R.J., Gould, R.J., Jacobson, M.S., Lesniak, L.: Generalizing pancyclic and $$k$$-ordered graphs. Graphs Combin. 20, 291\u2013310 (2004)","journal-title":"Graphs Combin."},{"key":"2108_CR9","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1007\/s00373-014-1506-1","volume":"31","author":"M Furuya","year":"2015","unstructured":"Furuya, M., Tsuchiya, S.: Claw-free and $$N(2,1,0)$$-free graphs are almost net-free. Graphs Combin. 31, 2201\u20132205 (2015)","journal-title":"Graphs Combin."},{"key":"2108_CR10","first-page":"129","volume-title":"Studies on Minimally $$n$$-Connected Graphs. In Combinatorial Mathematics and Its Applications","author":"R Halin","year":"1969","unstructured":"Halin, R.: Studies on Minimally $$n$$-Connected Graphs. In Combinatorial Mathematics and Its Applications, pp. 129\u2013136. Academic Press, London (1969)"},{"key":"2108_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(88)90143-3","volume":"28","author":"S Olariu","year":"1988","unstructured":"Olariu, S.: Paw-free graph. Inform. Process. Lett. 28, 53\u201354 (1988)","journal-title":"Inform. Process. Lett."},{"key":"2108_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1006\/jctb.2002.2131","volume":"86","author":"Z Ryj\u00e1\u010dek","year":"2002","unstructured":"Ryj\u00e1\u010dek, Z.: Closure and forbidden pairs for Hamiltonicity. J. Combin. Theory Ser. B 86, 331\u2013346 (2002)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02108-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02108-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02108-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,17]],"date-time":"2020-10-17T23:22:44Z","timestamp":1602976964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02108-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,19]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["2108"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02108-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2019,10,19]]},"assertion":[{"value":"13 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}