{"id":"https://openalex.org/W1989216097","doi":"https://doi.org/10.1002/(sici)1097-0118(199605)22:1<83::aid-jgt11>3.0.co;2-p","title":"A short proof of a theorem on Hamiltonian graphs","display_name":"A short proof of a theorem on Hamiltonian graphs","publication_year":1996,"publication_date":"1996-05-01","ids":{"openalex":"https://openalex.org/W1989216097","doi":"https://doi.org/10.1002/(sici)1097-0118(199605)22:1<83::aid-jgt11>3.0.co;2-p","mag":"1989216097"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0118(199605)22:1<83::aid-jgt11>3.0.co;2-p","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0118(199605)22:1<83::aid-jgt11>3.0.co;2-p","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","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/I4210135736","display_name":"Centre de Recherche Nucl\u00e9aire d\u2019Alger","ror":"https://ror.org/049ntvc74","country_code":"DZ","type":"facility","lineage":["https://openalex.org/I4210135736"]}],"countries":["DZ"],"is_corresponding":true,"raw_author_name":"A. Ainouche","raw_affiliation_strings":["U S T H B-Centre de Calcul, BP 32 El-Alia, 16111 Alger, Algeria","U S T H B\u2010Centre de Calcul, BP 32 El\u2010Alia, 16111 Alger, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"U S T H B-Centre de Calcul, BP 32 El-Alia, 16111 Alger, Algeria","institution_ids":["https://openalex.org/I4210135736"]},{"raw_affiliation_string":"U S T H B\u2010Centre de Calcul, BP 32 El\u2010Alia, 16111 Alger, Algeria","institution_ids":["https://openalex.org/I4210135736"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005823159"],"corresponding_institution_ids":["https://openalex.org/I4210135736"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.115707,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":"1","first_page":"83","last_page":"87"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9865999817848206,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9857000112533569,"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/mathematics","display_name":"Mathematics","score":0.7729637622833252},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7543034553527832},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6096727848052979},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.5980114340782166},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5036033987998962},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41759106516838074}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7729637622833252},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7543034553527832},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6096727848052979},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.5980114340782166},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5036033987998962},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41759106516838074},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/(sici)1097-0118(199605)22:1<83::aid-jgt11>3.0.co;2-p","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0118(199605)22:1<83::aid-jgt11>3.0.co;2-p","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W2077066936","https://openalex.org/W2002282073","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W4287664878","https://openalex.org/W3212023493","https://openalex.org/W2011977293"],"abstract_inverted_index":{"In":[0],"this":[1],"note,":[2],"we":[3],"give":[4],"a":[5,9,19],"short":[6],"proof":[7],"of":[8,12,22],"stronger":[10],"version":[11],"the":[13],"following":[14],"theorem:":[15],"Let":[16],"G":[17,48],"be":[18],"2-connected":[20],"graph":[21],"order":[23],"n":[24,30],"such":[25],"that":[26],"\\documentclass{article}\\pagestyle{empty}\\begin{document}$":[27],"d(u)+d(v)+d(w)":[28],"\\geq":[29],"+":[31],"\\mid":[32,38],"N(u)":[33],"\\cap":[34,36],"N(v)":[35],"N(w)":[37],"$\\end{document}":[39],"for":[40],"any":[41],"independent":[42],"set":[43],"{u,":[44],"v,":[45],"w},":[46],"then":[47],"is":[49],"hamiltonian.":[50],"\u00a9":[51],"1996":[52],"John":[53],"Wiley":[54],"&":[55],"Sons":[56],"Inc.":[57]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}