{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T05:19:15Z","timestamp":1698038355274},"reference-count":6,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":8251,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1984,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Various Harniltonian\u2010like properties are investigated in the squares of connected graphs free of some set of forbidden subgraphs. The star <jats:italic>K<\/jats:italic><jats:sub>1,4<\/jats:sub> the subdivision graph of <jats:italic>K<\/jats:italic><jats:sub>1,3<\/jats:sub>, and the subdivision graph of <jats:italic>K<\/jats:italic><jats:sub>1,3<\/jats:sub> minus an endvertex play central roles. In particular, we show that connected graphs free of the subdivision graph of <jats:italic>K<\/jats:italic><jats:sub>1,3<\/jats:sub> minus an endvertex have vertex pancyclic squares.<\/jats:p>","DOI":"10.1002\/jgt.3190080117","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T11:16:56Z","timestamp":1180178216000},"page":"147-154","source":"Crossref","is-referenced-by-count":5,"title":["Forbidden subgraphs and hamiitonian properties in the square of a connected graph"],"prefix":"10.1002","volume":"8","author":[{"given":"Ronald J.","family":"Gould","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael S.","family":"Jacobson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Graphs and Digraphs","author":"Behzad M.","year":"1979"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90091-4"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305995"},{"key":"e_1_2_1_5_2","unstructured":"R.Gould Traceability in graphs. Ph. D. Thesis Western Michigan University (1979)."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300008494"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190080116"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190080117","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190080117","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T12:38:00Z","timestamp":1695818280000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190080117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,3]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,3]]}},"alternative-id":["10.1002\/jgt.3190080117"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190080117","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,3]]}}}