{"id":"https://openalex.org/W2003980189","doi":"https://doi.org/10.1016/0095-8956(81)90035-6","title":"Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs","display_name":"Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs","publication_year":1981,"publication_date":"1981-12-01","ids":{"openalex":"https://openalex.org/W2003980189","doi":"https://doi.org/10.1016/0095-8956(81)90035-6","mag":"2003980189"},"language":"en","primary_location":{"id":"doi:10.1016/0095-8956(81)90035-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0095-8956(81)90035-6","pdf_url":null,"source":{"id":"https://openalex.org/S2939117604","display_name":"Journal of Combinatorial Theory Series B","issn_l":"0095-8956","issn":["0095-8956","1096-0902"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Theory, Series B","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/A5005823159","display_name":"Ahmed Ainouche","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ahmed Ainouche","raw_affiliation_strings":["Department of Management Science, Imperial College, London SW7 2BX, Great Britain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Management Science, Imperial College, London SW7 2BX, Great Britain","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111519836","display_name":"Nicos Christofides","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nicos Christofides","raw_affiliation_strings":["Department of Management Science, Imperial College, London SW7 2BX, Great Britain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Management Science, Imperial College, London SW7 2BX, Great Britain","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":{"value":3110,"currency":"USD","value_usd":3110},"apc_paid":null,"fwci":0.5994,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.62147407,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"31","issue":"3","first_page":"339","last_page":"343"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9994999766349792,"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.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.8378759622573853},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.683176577091217},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6759068965911865},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.6511458158493042},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.6257626414299011},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4627169966697693},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4581112265586853},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.44529515504837036},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42015552520751953},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.06040579080581665}],"concepts":[{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.8378759622573853},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.683176577091217},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6759068965911865},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.6511458158493042},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.6257626414299011},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4627169966697693},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4581112265586853},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.44529515504837036},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42015552520751953},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.06040579080581665}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0095-8956(81)90035-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0095-8956(81)90035-6","pdf_url":null,"source":{"id":"https://openalex.org/S2939117604","display_name":"Journal of Combinatorial Theory Series B","issn_l":"0095-8956","issn":["0095-8956","1096-0902"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Theory, Series B","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":2,"referenced_works":["https://openalex.org/W2000467025","https://openalex.org/W2069905179"],"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/W2027410688"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}