{"id":"https://openalex.org/W2026263715","doi":"https://doi.org/10.1002/net.3230060104","title":"On the optional hamiltonian completion problem","display_name":"On the optional hamiltonian completion problem","publication_year":1976,"publication_date":"1976-01-01","ids":{"openalex":"https://openalex.org/W2026263715","doi":"https://doi.org/10.1002/net.3230060104","mag":"2026263715"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230060104","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230060104","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5104034853","display_name":"Peter J. Slater","orcid":null},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"P. J. Slater","raw_affiliation_strings":["University of Iowa Iowa City, Iowa","\u2217University of Iowa, Iowa City, Iowa"],"affiliations":[{"raw_affiliation_string":"University of Iowa Iowa City, Iowa","institution_ids":["https://openalex.org/I126307644"]},{"raw_affiliation_string":"\u2217University of Iowa, Iowa City, Iowa","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111147237","display_name":"S. E. Goodman","orcid":null},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. E. Goodman","raw_affiliation_strings":["University of Virginia Charlottesville, Virginia","University of Virginia  Charlottesville Virginia"],"affiliations":[{"raw_affiliation_string":"University of Virginia Charlottesville, Virginia","institution_ids":["https://openalex.org/I51556381"]},{"raw_affiliation_string":"University of Virginia  Charlottesville Virginia","institution_ids":["https://openalex.org/I51556381"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111934510","display_name":"Stephen T. Hedetniemi","orcid":null},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. T. Hedetniemi","raw_affiliation_strings":["University of Virginia Charlottesville, Virginia","University of Virginia  Charlottesville Virginia"],"affiliations":[{"raw_affiliation_string":"University of Virginia Charlottesville, Virginia","institution_ids":["https://openalex.org/I51556381"]},{"raw_affiliation_string":"University of Virginia  Charlottesville Virginia","institution_ids":["https://openalex.org/I51556381"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5104034853"],"corresponding_institution_ids":["https://openalex.org/I126307644"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.5691,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.62317766,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":"1","first_page":"35","last_page":"51"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9815000295639038,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9739999771118164,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.7657160758972168},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7069305181503296},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5831560492515564},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5268363356590271},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.49915242195129395},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.44640302658081055},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4177979826927185},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34504538774490356},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31108033657073975}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.7657160758972168},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7069305181503296},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5831560492515564},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5268363356590271},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.49915242195129395},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.44640302658081055},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4177979826927185},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34504538774490356},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31108033657073975}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230060104","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230060104","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W96889678","https://openalex.org/W1982255740","https://openalex.org/W2032950184","https://openalex.org/W2067396114","https://openalex.org/W2090154053","https://openalex.org/W2488940570","https://openalex.org/W6667430009"],"related_works":["https://openalex.org/W4387272283","https://openalex.org/W1618127724","https://openalex.org/W4299647289","https://openalex.org/W2155631825","https://openalex.org/W2952856011","https://openalex.org/W2011032737","https://openalex.org/W2078431586","https://openalex.org/W2069133957","https://openalex.org/W140019436","https://openalex.org/W4243020994"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"Optional":[2],"Hamiltonian":[3],"Completion":[4],"Problem":[5],"is":[6],"defined":[7],"as":[8],"follows:":[9],"let":[10],"the":[11,37],"points":[12,27,71],"V":[13,23,31,60,73],"of":[14,25,33,40,59,72],"a":[15,21,29,50,54],"graph":[16,51],"G":[17,47],"be":[18],"partitioned":[19],"into":[20],"set":[22,30],"0":[24,74],"optional":[26,70],"and":[28,90],"1":[32,61],"non\u2010optional":[34],"points;":[35],"determine":[36],"minimum":[38],"number":[39],"new":[41],"lines":[42],"which":[43,52],"when":[44],"added":[45],"to":[46],"result":[48],"in":[49],"has":[53],"cycle":[55,64],"containing":[56],"every":[57],"point":[58],".":[62,75],"This":[63],"may":[65,67],"or":[66],"not":[68],"contain":[69],"In":[76],"this":[77,84],"paper":[78],"we":[79],"present":[80],"algorithms":[81],"for":[82,86],"solving":[83],"problem":[85],"trees,":[87],"unicyclic":[88],"graphs":[89],"cacti.":[91]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}