{"id":"https://openalex.org/W2087818742","doi":"https://doi.org/10.1137/0205049","title":"The Planar Hamiltonian Circuit Problem is NP-Complete","display_name":"The Planar Hamiltonian Circuit Problem is NP-Complete","publication_year":1976,"publication_date":"1976-12-01","ids":{"openalex":"https://openalex.org/W2087818742","doi":"https://doi.org/10.1137/0205049","mag":"2087818742"},"language":"en","primary_location":{"id":"doi:10.1137/0205049","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0205049","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/A5047995033","display_name":"M. R. Garey","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M. R. Garey","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014391544","display_name":"D. S. Johnson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. S. Johnson","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Endre Tarjan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047995033"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.489,"has_fulltext":false,"cited_by_count":524,"citation_normalized_percentile":{"value":0.97342657,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"5","issue":"4","first_page":"704","last_page":"714"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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.9991000294685364,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.7575723528862},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.743337094783783},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6802728176116943},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.6739530563354492},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6434432864189148},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6133586764335632},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.5797296762466431},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5173737406730652},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49212712049484253},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42660757899284363},{"id":"https://openalex.org/keywords/planar-straight-line-graph","display_name":"Planar straight-line graph","score":0.42029866576194763},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.31230324506759644},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30836760997772217},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.2765619158744812},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.24743154644966125},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.16982495784759521}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.7575723528862},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.743337094783783},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6802728176116943},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.6739530563354492},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6434432864189148},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6133586764335632},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.5797296762466431},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5173737406730652},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49212712049484253},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42660757899284363},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.42029866576194763},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31230324506759644},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30836760997772217},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2765619158744812},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.24743154644966125},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.16982495784759521},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0205049","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0205049","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":7,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1530753374","https://openalex.org/W1655990431","https://openalex.org/W1995621089","https://openalex.org/W2030087828","https://openalex.org/W2401610261","https://openalex.org/W2470676942"],"related_works":["https://openalex.org/W4387272283","https://openalex.org/W1618127724","https://openalex.org/W1977187614","https://openalex.org/W2052982152","https://openalex.org/W2013764132","https://openalex.org/W1764798208","https://openalex.org/W1975729263","https://openalex.org/W4251672073","https://openalex.org/W1974537697","https://openalex.org/W2524771967"],"abstract_inverted_index":{"We":[0,17],"consider":[1],"the":[2,25],"problem":[3,21,28],"of":[4,32],"determining":[5],"whether":[6],"a":[7,14],"planar,":[8],"cubic,":[9],"triply-connected":[10],"graph":[11],"G":[12],"has":[13],"Hamiltonian":[15,26],"circuit.":[16],"show":[18],"that":[19],"this":[20,30],"is":[22,42],"NP-complete.":[23],"Hence":[24],"circuit":[27],"for":[29],"class":[31,37],"graphs,":[33,41],"or":[34],"any":[35],"larger":[36],"containing":[38],"all":[39],"such":[40],"probably":[43],"computationally":[44],"intractable.":[45]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":29},{"year":2021,"cited_by_count":23},{"year":2020,"cited_by_count":24},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":23},{"year":2017,"cited_by_count":24},{"year":2016,"cited_by_count":20},{"year":2015,"cited_by_count":25},{"year":2014,"cited_by_count":20},{"year":2013,"cited_by_count":23},{"year":2012,"cited_by_count":15}],"updated_date":"2026-04-07T14:57:38.498316","created_date":"2025-10-10T00:00:00"}