{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T01:48:58Z","timestamp":1673142538952},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,1,10]],"date-time":"2015-01-10T00:00:00Z","timestamp":1420848000000},"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":[[2015,11]]},"DOI":"10.1007\/s00373-014-1506-1","type":"journal-article","created":{"date-parts":[[2015,1,9]],"date-time":"2015-01-09T00:15:56Z","timestamp":1420762556000},"page":"2201-2205","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Claw-Free and $$N(2,1,0)$$ N ( 2 , 1 , 0 ) -Free Graphs are Almost Net-Free"],"prefix":"10.1007","volume":"31","author":[{"given":"Michitaka","family":"Furuya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shoichi","family":"Tsuchiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,10]]},"reference":[{"key":"1506_CR1","unstructured":"Bedrossian, P.: Forbidden subgraph and minimum degree conditions for Hamiltonicity, Ph.D. Thesis. Memphis State University (1991)"},{"key":"1506_CR2","doi-asserted-by":"crossref","unstructured":"Diestel,R.: Graph Theory, Graduate Texts in Mathematics 173, Springer (2010)","DOI":"10.1007\/978-3-642-14279-6"},{"key":"1506_CR3","unstructured":"Duffus,D., Gould, R.J., Jacobson,M.S., Forbidden subgraphs and the Hamiltonian theme. The theory and applications of graphs, pp. 297\u2013316, Wiley, New York (1981)"},{"key":"1506_CR4","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":"1506_CR5","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0095-8956(91)90074-T","volume":"53","author":"FB Shepherd","year":"1991","unstructured":"Shepherd, F.B.: Hamiltonicity in claw-free graphs. J Combin Theory Ser B 53, 173\u2013194 (1991)","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-014-1506-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1506-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1506-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T09:04:00Z","timestamp":1566205440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1506-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,10]]},"references-count":5,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["1506"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1506-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,10]]}}}