{"id":"https://openalex.org/W1975729263","doi":"https://doi.org/10.1137/0211042","title":"The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs","display_name":"The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs","publication_year":1982,"publication_date":"1982-08-01","ids":{"openalex":"https://openalex.org/W1975729263","doi":"https://doi.org/10.1137/0211042","mag":"1975729263"},"language":"en","primary_location":{"id":"doi:10.1137/0211042","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0211042","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/A5025612091","display_name":"Dominique Gouyou-Beauchamps","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"D. Gouyou-Beauchamps","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5025612091"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1413,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.86335677,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"11","issue":"3","first_page":"529","last_page":"539"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9983000159263611,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9968000054359436,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.7875576019287109},{"id":"https://openalex.org/keywords/planar-straight-line-graph","display_name":"Planar straight-line graph","score":0.6542139053344727},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6481186151504517},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5986442565917969},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5896431803703308},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5600968599319458},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.5533818006515503},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5225426554679871},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.5168612599372864},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.4532398581504822},{"id":"https://openalex.org/keywords/polyhedral-graph","display_name":"Polyhedral graph","score":0.43505096435546875},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3798770010471344},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.33514702320098877},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.27132296562194824},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25967711210250854},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.2333221137523651},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16178125143051147},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.0672214925289154}],"concepts":[{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.7875576019287109},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.6542139053344727},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6481186151504517},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5986442565917969},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5896431803703308},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5600968599319458},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.5533818006515503},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5225426554679871},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.5168612599372864},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.4532398581504822},{"id":"https://openalex.org/C91233654","wikidata":"https://www.wikidata.org/wiki/Q4555371","display_name":"Polyhedral graph","level":5,"score":0.43505096435546875},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3798770010471344},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.33514702320098877},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.27132296562194824},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25967711210250854},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2333221137523651},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16178125143051147},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0672214925289154},{"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/0211042","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0211042","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1482143660","https://openalex.org/W1655990431","https://openalex.org/W1969633293","https://openalex.org/W2014637829","https://openalex.org/W2034011690","https://openalex.org/W2050065904","https://openalex.org/W2065953381","https://openalex.org/W2087818742","https://openalex.org/W2094542439","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W1759199114","https://openalex.org/W2039281885","https://openalex.org/W1985156927","https://openalex.org/W2942112873","https://openalex.org/W2995965358","https://openalex.org/W2963028755","https://openalex.org/W2009558719","https://openalex.org/W2001770522","https://openalex.org/W1975729263","https://openalex.org/W2985721051"],"abstract_inverted_index":{"An":[0],"algorithm":[1,20,72],"for":[2,18,67],"the":[3,28,33,35,46,63,76,83],"determination":[4],"of":[5,30,48,78,85],"an":[6],"Hamiltonian":[7,86],"circuit":[8],"in":[9,32,88],"a":[10],"4-connected":[11,89],"planar":[12,69,90],"graph":[13],"is":[14,27,65,73],"presented.":[15],"The":[16],"timing":[17],"this":[19],"depends":[21,39],"on":[22,40],"$n^3":[23,41],"$":[24],"(where":[25],"n":[26],"number":[29],"edges":[31],"graph);":[34],"storage":[36],"requirement":[37],"also":[38],"$.":[42],"This":[43,71],"paper":[44],"completes":[45],"result":[47],"Garey,":[49],"Johnson":[50],"and":[51],"Tarjan":[52],"[SIAM":[53],"J.":[54],"Comput.,":[55],"5":[56],"(1976),":[57],"pp.":[58],"704\u2013714]":[59],"which":[60,81],"claims":[61],"that":[62],"problem":[64],"NP-complete":[66],"3-connected":[68],"graphs.":[70,91],"inspired":[74],"by":[75],"proof":[77],"Tutte\u2019s":[79],"theorem":[80],"implies":[82],"existence":[84],"circuits":[87]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}