{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:08:16Z","timestamp":1699834096088},"reference-count":6,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2007,3,2]],"date-time":"2007-03-02T00:00:00Z","timestamp":1172793600000},"content-version":"vor","delay-in-days":11383,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1976,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The Optional Hamiltonian Completion Problem is defined as follows: let the points V of a graph G be partitioned into a set V<jats:sub>0<\/jats:sub> of optional points and a set V<jats:sub>1<\/jats:sub> of non\u2010optional points; determine the minimum number of new lines which when added to G result in a graph which has a cycle containing every point of V<jats:sub>1<\/jats:sub>. This cycle may or may not contain optional points of V<jats:sub>0<\/jats:sub>. In this paper we present algorithms for solving this problem for trees, unicyclic graphs and cacti.<\/jats:p>","DOI":"10.1002\/net.3230060104","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T02:25:17Z","timestamp":1178850317000},"page":"35-51","source":"Crossref","is-referenced-by-count":5,"title":["On the optional hamiltonian completion problem"],"prefix":"10.1002","volume":"6","author":[{"given":"P. J.","family":"Slater","sequence":"first","affiliation":[]},{"given":"S. E.","family":"Goodman","sequence":"additional","affiliation":[]},{"given":"S. T.","family":"Hedetniemi","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,2]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"262","volume-title":"Graphs and Combinatorics","author":"Boesch F. T.","year":"1974"},{"key":"e_1_2_1_3_2","first-page":"201","volume-title":"Graphs and Combinatorics","author":"Goodman S.","year":"1974"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/321892.321897"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","DOI":"10.1137\/0205009","volume-title":"B\u2010Matchings in Trees","author":"Goodman S.","year":"1976"},{"key":"e_1_2_1_6_2","article-title":"A Linear Algorithm for the Domination Number of a Tree","author":"Cockayne E.","journal-title":"Information Processing Letters"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/800119.803884"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230060104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230060104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T12:17:33Z","timestamp":1699791453000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230060104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,1]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,1]]}},"alternative-id":["10.1002\/net.3230060104"],"URL":"https:\/\/doi.org\/10.1002\/net.3230060104","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1976,1]]}}}