{"id":"https://openalex.org/W2139013226","doi":"https://doi.org/10.1137/0213008","title":"The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem","display_name":"The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem","publication_year":1984,"publication_date":"1984-02-01","ids":{"openalex":"https://openalex.org/W2139013226","doi":"https://doi.org/10.1137/0213008","mag":"2139013226"},"language":"en","primary_location":{"id":"doi:10.1137/0213008","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213008","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5074720054","display_name":"Udi Manber","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Udi Manber","raw_affiliation_strings":["University of Wisconsin, Madison"],"affiliations":[{"raw_affiliation_string":"University of Wisconsin, Madison","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008676408","display_name":"Martin Tompa","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]},{"id":"https://openalex.org/I58610484","display_name":"Seattle University","ror":"https://ror.org/02jqc0m91","country_code":"US","type":"education","lineage":["https://openalex.org/I58610484"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Tompa","raw_affiliation_strings":["University of Washington , Seattle"],"affiliations":[{"raw_affiliation_string":"University of Washington , Seattle","institution_ids":["https://openalex.org/I58610484","https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074720054"],"corresponding_institution_ids":["https://openalex.org/I135310074"],"apc_list":null,"apc_paid":null,"fwci":1.5829,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.84534837,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"13","issue":"1","first_page":"109","last_page":"115"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.982699990272522,"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.982699990272522,"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/T11476","display_name":"Graph theory and applications","score":0.9136000275611877,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9007999897003174,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8247448205947876},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7166841626167297},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.683627188205719},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5177282691001892},{"id":"https://openalex.org/keywords/uniqueness","display_name":"Uniqueness","score":0.5101642608642578},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48667198419570923},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.44363150000572205},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42971447110176086},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.42525067925453186},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.4180352985858917}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8247448205947876},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7166841626167297},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.683627188205719},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5177282691001892},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.5101642608642578},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48667198419570923},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.44363150000572205},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42971447110176086},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.42525067925453186},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.4180352985858917},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0213008","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213008","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1970691969","https://openalex.org/W2050394746","https://openalex.org/W2118382442","https://openalex.org/W2155803955"],"related_works":["https://openalex.org/W571281153","https://openalex.org/W2949403936","https://openalex.org/W3023806604","https://openalex.org/W2952139525","https://openalex.org/W4301247218","https://openalex.org/W2588150626","https://openalex.org/W2527800796","https://openalex.org/W4300838148","https://openalex.org/W2099631921","https://openalex.org/W2218322294"],"abstract_inverted_index":{"A":[0],"generalization":[1],"of":[2,73,87,109],"Dobkin":[3],"and":[4,70,105,131],"Lipton\u2019s":[5],"element":[6],"uniqueness":[7],"problem":[8,32,64],"is":[9,33,65,81],"introduced.":[10],"For":[11],"any":[12,82,94],"fixed":[13],"undirected":[14],"graph":[15,96],"G":[16,80],"on":[17],"vertex":[18],"set":[19],"$\\{":[20,54],"v":[21],"_1":[22],",":[23,25,27,42],"v_2":[24],"\\cdots":[26,43],"v_n":[28],"\\}":[29,59],"$,":[30,45],"the":[31,88,107,126],"to":[34,67,113],"determine,":[35],"given":[36],"n":[37],"real":[38],"numbers":[39],"$x_1":[40],",x_2":[41],",x_n":[44],"whether":[46],"$x_i":[47],"\\ne":[48],"x_j":[49],"$":[50,60],"for":[51,124,135],"every":[52],"edge":[53],"\\upsilon":[55],"_i":[56],",\\upsilon":[57],"_j":[58],"in":[61],"G.":[62],"This":[63],"shown":[66],"have":[68],"upper":[69,139],"lower":[71,89,128],"bounds":[72],"$\\Theta":[74],"(n\\log":[75],"n)$":[76],"linear":[77,138],"comparisons":[78],"if":[79],"dense":[83,95,133],"graph.":[84],"The":[85],"proof":[86],"bound":[90,129,140],"involves":[91],"showing":[92],"that":[93],"must":[97],"contain":[98],"a":[99,114,137],"subgraph":[100],"with":[101],"many":[102],"Hamiltonian":[103,111],"paths,":[104],"demonstrating":[106],"relevance":[108],"these":[110],"paths":[112],"geometric":[115],"argument.":[116],"In":[117],"addition,":[118],"we":[119],"exhibit":[120],"relatively":[121,132],"sparse":[122],"graphs":[123,134],"which":[125,136],"same":[127],"holds,":[130],"holds.":[141]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}