{"id":"https://openalex.org/W1990945383","doi":"https://doi.org/10.1002/jgt.3190160602","title":"An improvement of fraisse's sufficient condition for hamiltonian graphs","display_name":"An improvement of fraisse's sufficient condition for hamiltonian graphs","publication_year":1992,"publication_date":"1992-12-01","ids":{"openalex":"https://openalex.org/W1990945383","doi":"https://doi.org/10.1002/jgt.3190160602","mag":"1990945383"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190160602","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190160602","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":[],"countries":[],"is_corresponding":true,"raw_author_name":"A. Ainouche","raw_affiliation_strings":["Usthb\u2014centre De Calcul BP 32 El-alia 16111 Alger (Algeria)","Usthb\u2014centre De Calcul BP 32 El\u2010alia 16111 Alger (Algeria)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Usthb\u2014centre De Calcul BP 32 El-alia 16111 Alger (Algeria)","institution_ids":[]},{"raw_affiliation_string":"Usthb\u2014centre De Calcul BP 32 El\u2010alia 16111 Alger (Algeria)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5005823159"],"corresponding_institution_ids":[],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":1.4347,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.8019504,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"16","issue":"6","first_page":"529","last_page":"543"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9995999932289124,"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/combinatorics","display_name":"Combinatorics","score":0.8880775570869446},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8216486573219299},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6273398399353027},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.5575133562088013},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.516555666923523},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5058631300926208},{"id":"https://openalex.org/keywords/bound-graph","display_name":"Bound graph","score":0.42045271396636963},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39962995052337646},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.23617079854011536},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07522401213645935}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8880775570869446},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8216486573219299},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6273398399353027},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.5575133562088013},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.516555666923523},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5058631300926208},{"id":"https://openalex.org/C121134508","wikidata":"https://www.wikidata.org/wiki/Q4949882","display_name":"Bound graph","level":5,"score":0.42045271396636963},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39962995052337646},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.23617079854011536},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07522401213645935},{"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/jgt.3190160602","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190160602","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1971367602","https://openalex.org/W2035089435","https://openalex.org/W2055532678","https://openalex.org/W2069905179","https://openalex.org/W2155943357","https://openalex.org/W2369359433","https://openalex.org/W2577446513","https://openalex.org/W7009823207"],"related_works":["https://openalex.org/W3033929256","https://openalex.org/W2937406279","https://openalex.org/W2226543729","https://openalex.org/W4381094520","https://openalex.org/W1527576459","https://openalex.org/W2809930434","https://openalex.org/W3159927204","https://openalex.org/W2024800008","https://openalex.org/W2793144387","https://openalex.org/W2157163513"],"abstract_inverted_index":{"Abstract":[0],"Let":[1],"G":[2,99],"be":[3,19,36],"a":[4],"k":[5],"\u2010connected":[6],"graph":[7],"of":[8,22,30,39,47,93],"order":[9],"n":[10],".":[11,49],"For":[12],"an":[13],"independent":[14],"set":[15,83],"c,":[16],"let":[17,34],"d(S)":[18],"the":[20,37],"number":[21,38],"vertices":[23,40,46],"adjacent":[24,41],"to":[25,42],"at":[26,43],"least":[27,44],"one":[28],"vertex":[29],"S":[31,48],"and":[32],">":[33,72],"i(S)":[35],"|S|":[45],"We":[50],"prove":[51],"that":[52,64],"if":[53],"there":[54],"exists":[55],"some":[56],"s,":[57],"1":[58,89,96],"\u2264":[59,61],"s":[60,91,94],"k,":[62],"such":[63],"\u03a3":[65],"x":[66,88],"i":[67,70,77],"EX":[68],"d(X\\{X":[69],"})":[71],"s(n\u22121)":[73],"\u2013":[74,76],"k[s/2]":[75],"(X)[(s\u22121)/2]":[78],"holds":[79],"for":[80,109],"every":[81],"independetn":[82],"X":[84],"={x":[85],"0":[86],",":[87],"\u20dbx":[90],"}":[92],"+":[95],"vertices,":[97],"then":[98],"is":[100],"hamiltonian.":[101],"Several":[102],"known":[103],"results,":[104],"including":[105],"Fraisse's":[106],"sufficient":[107],"condition":[108],"hamiltonian":[110],"graphs,":[111],"are":[112],"dervied":[113],"as":[114],"corollaries.":[115]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}