{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T18:56:30Z","timestamp":1698000990872},"reference-count":2,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":8342,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1983,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The Hamiltonian path graph <jats:italic>H(G)<\/jats:italic> of a graph <jats:italic>G<\/jats:italic> is that graph having the same vertex set as <jats:italic>G<\/jats:italic> and in which two vertices <jats:italic>u<\/jats:italic> and <jats:italic>v<\/jats:italic> are adjacent if and only if <jats:italic>G<\/jats:italic> contains a Hamiltonian <jats:italic>u\u2010v<\/jats:italic> path. A characterization of Hamiltonian graphs isomorphic to their Hamiltonian path graphs is presented.<\/jats:p>","DOI":"10.1002\/jgt.3190070406","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T07:03:43Z","timestamp":1180422223000},"page":"419-427","source":"Crossref","is-referenced-by-count":4,"title":["Hamiltonian path graphs"],"prefix":"10.1002","volume":"7","author":[{"given":"Gary","family":"Chartrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. F.","family":"Kapoor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. A.","family":"Nordhaus","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","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90075-6"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90074-4"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190070406","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190070406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T09:22:03Z","timestamp":1697793723000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190070406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,12]]},"references-count":2,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1983,12]]}},"alternative-id":["10.1002\/jgt.3190070406"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190070406","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,12]]}}}