{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:39:19Z","timestamp":1760819959349},"reference-count":8,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":9528,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1980,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A Hamiltonian walk of a connected graph is a shortest closed walk that passes through every vertex at least once, and the length of a Hamiltonian walk is the total number of edges traversed by the walk. We show that every maximal planar graph with <jats:italic>p<\/jats:italic>(\u2265 3) vertices has a Hamiltonian cycle or a Hamiltonian walk of length \u2264 3(<jats:italic>p<\/jats:italic> \u2010 3)\/2.<\/jats:p>","DOI":"10.1002\/jgt.3190040310","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T10:47:14Z","timestamp":1180176434000},"page":"315-336","source":"Crossref","is-referenced-by-count":16,"title":["An upper bound on the length of a Hamiltonian walk of a maximal planar graph"],"prefix":"10.1002","volume":"4","author":[{"given":"Takao","family":"Asano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takahiro","family":"Watanabe","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\/S0021-9800(70)80054-0"},{"key":"e_1_2_1_3_2","first-page":"41","volume-title":"Proceedings of the 5th British Combinatorial Conference","author":"Bermond J. C.","year":"1975"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1137\/0203017"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(73)90012-5"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"e_1_2_1_7_2","unstructured":"J. L.Jolivet Hamiltonian pseudo cycles in graphs. Proceedings 5th Southeastern Conference Combinatorics Graph Theory and Computing Boca Raton (1975)529\u2013533."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1963.13.629"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.2307\/1968197"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190040310","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190040310","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T08:19:26Z","timestamp":1699777166000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190040310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,9]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,9]]}},"alternative-id":["10.1002\/jgt.3190040310"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190040310","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,9]]}}}