{"id":"https://openalex.org/W1983755786","doi":"https://doi.org/10.1016/0196-6774(89)90012-6","title":"The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs","display_name":"The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs","publication_year":1989,"publication_date":"1989-06-01","ids":{"openalex":"https://openalex.org/W1983755786","doi":"https://doi.org/10.1016/0196-6774(89)90012-6","mag":"1983755786"},"language":"en","primary_location":{"id":"doi:10.1016/0196-6774(89)90012-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(89)90012-6","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","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/A5048417287","display_name":"Norishige Chiba","orcid":null},"institutions":[{"id":"https://openalex.org/I173009982","display_name":"Iwate University","ror":"https://ror.org/04cd75h10","country_code":"JP","type":"education","lineage":["https://openalex.org/I173009982"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Norishige Chiba","raw_affiliation_strings":["Department of Computer Science, Faculty of Engineering, Iwate University, Morioka 020, Japan","Iwate University, Morioka, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Engineering, Iwate University, Morioka 020, Japan","institution_ids":["https://openalex.org/I173009982"]},{"raw_affiliation_string":"Iwate University, Morioka, Japan","institution_ids":["https://openalex.org/I173009982"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033580185","display_name":"Takao Nishizeki","orcid":null},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takao Nishizeki","raw_affiliation_strings":["Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai 980, Japan","Tohoku University Sendai, Japan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai 980, Japan","institution_ids":["https://openalex.org/I201537933"]},{"raw_affiliation_string":"Tohoku University Sendai, Japan#TAB#","institution_ids":["https://openalex.org/I201537933"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.7929,"has_fulltext":false,"cited_by_count":94,"citation_normalized_percentile":{"value":0.95679363,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"10","issue":"2","first_page":"187","last_page":"211"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983999729156494,"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.9983999729156494,"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.9940000176429749,"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"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9940000176429749,"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.7875382900238037},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.7205966114997864},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.7134261131286621},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6695547103881836},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6262966990470886},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5852011442184448},{"id":"https://openalex.org/keywords/cycle-basis","display_name":"Cycle basis","score":0.5378758907318115},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.535284161567688},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.4586522579193115},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4295095205307007},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41958898305892944},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.4108020067214966},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3227246105670929},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2295694649219513},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.18303853273391724},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1572679877281189},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.12507519125938416}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.7875382900238037},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.7205966114997864},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.7134261131286621},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6695547103881836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6262966990470886},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5852011442184448},{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.5378758907318115},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.535284161567688},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.4586522579193115},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4295095205307007},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41958898305892944},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.4108020067214966},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3227246105670929},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2295694649219513},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.18303853273391724},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1572679877281189},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12507519125938416},{"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.1016/0196-6774(89)90012-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(89)90012-6","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","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":12,"referenced_works":["https://openalex.org/W1518358948","https://openalex.org/W1969633293","https://openalex.org/W1975729263","https://openalex.org/W1994556169","https://openalex.org/W2050065904","https://openalex.org/W2057568938","https://openalex.org/W2066356146","https://openalex.org/W2078415120","https://openalex.org/W2082927087","https://openalex.org/W2087818742","https://openalex.org/W2401610261","https://openalex.org/W6644040475"],"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/W2371794074","https://openalex.org/W4206195007","https://openalex.org/W1983755786","https://openalex.org/W4212928753","https://openalex.org/W2800672050"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}