{"id":"https://openalex.org/W3131669016","doi":"https://doi.org/10.37236/8657","title":"Hamiltonian Cycles in Tough $(P_2\\cup P_3)$-Free Graphs","display_name":"Hamiltonian Cycles in Tough $(P_2\\cup P_3)$-Free Graphs","publication_year":2021,"publication_date":"2021-02-11","ids":{"openalex":"https://openalex.org/W3131669016","doi":"https://doi.org/10.37236/8657","mag":"3131669016"},"language":"en","primary_location":{"id":"doi:10.37236/8657","is_oa":true,"landing_page_url":"https://doi.org/10.37236/8657","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v28i1p36/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v28i1p36/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015238599","display_name":"Songling Shan","orcid":"https://orcid.org/0000-0002-6384-2876"},"institutions":[{"id":"https://openalex.org/I47301684","display_name":"Illinois State University","ror":"https://ror.org/050kcr883","country_code":"US","type":"education","lineage":["https://openalex.org/I47301684"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Songling Shan","raw_affiliation_strings":["Illinois State University"],"affiliations":[{"raw_affiliation_string":"Illinois State University","institution_ids":["https://openalex.org/I47301684"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015238599"],"corresponding_institution_ids":["https://openalex.org/I47301684"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.05150552,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"28","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10829","display_name":"Interconnection Networks and Systems","score":0.994700014591217,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9936000108718872,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8614968061447144},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7704052329063416},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6464957594871521},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.64200758934021},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5470514893531799},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5443068146705627},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4880939722061157},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.43404191732406616},{"id":"https://openalex.org/keywords/pancyclic-graph","display_name":"Pancyclic graph","score":0.42487382888793945},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3870263397693634},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16436785459518433},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.13587215542793274}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8614968061447144},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7704052329063416},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6464957594871521},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.64200758934021},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5470514893531799},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5443068146705627},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4880939722061157},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.43404191732406616},{"id":"https://openalex.org/C166911692","wikidata":"https://www.wikidata.org/wiki/Q7130424","display_name":"Pancyclic graph","level":5,"score":0.42487382888793945},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3870263397693634},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16436785459518433},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.13587215542793274}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/8657","is_oa":true,"landing_page_url":"https://doi.org/10.37236/8657","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v28i1p36/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/8657","is_oa":true,"landing_page_url":"https://doi.org/10.37236/8657","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v28i1p36/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3131669016.pdf","grobid_xml":"https://content.openalex.org/works/W3131669016.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1973569903","https://openalex.org/W1975099798","https://openalex.org/W1996899555","https://openalex.org/W2001161770","https://openalex.org/W2007167081","https://openalex.org/W2055130189","https://openalex.org/W2092318469","https://openalex.org/W2119003746","https://openalex.org/W2477320853","https://openalex.org/W2725732964","https://openalex.org/W4287273055","https://openalex.org/W6649297506","https://openalex.org/W6650780096","https://openalex.org/W6652246145","https://openalex.org/W6677547984"],"related_works":["https://openalex.org/W2057580655","https://openalex.org/W2588150626","https://openalex.org/W4388585714","https://openalex.org/W2373602382","https://openalex.org/W2527800796","https://openalex.org/W2169450198","https://openalex.org/W2083864191","https://openalex.org/W2952856011","https://openalex.org/W203133463","https://openalex.org/W2099631921"],"abstract_inverted_index":{"Let":[0],"$t>0$":[1],"be":[2,8],"a":[3,9,56],"real":[4],"number":[5,29],"and":[6,103],"$G$":[7,13],"graph.":[10],"We":[11],"say":[12],"is":[14,34,40,69,71,78,122],"$t$-tough":[15],"if":[16,82],"for":[17,44],"every":[18,61,112],"cutset":[19],"$S$":[20],"of":[21,25,30,32,50,96,100],"$G$,":[22],"the":[23,28,94],"ratio":[24],"$|S|$":[26],"to":[27,91],"components":[31],"$G-S$":[33],"at":[35,65,118],"least":[36,66,119],"$t$.":[37],"Determining":[38],"toughness":[39],"an":[41],"NP-hard":[42],"problem":[43],"arbitrary":[45],"graphs.":[46],"The":[47],"Toughness":[48],"Conjecture":[49],"Chv\\'atal,":[51],"stating":[52],"that":[53,60,111],"there":[54],"exists":[55],"constant":[57],"$t_0$":[58],"such":[59],"$t_0$-tough":[62],"graph":[63,77,116],"with":[64,117],"three":[67,120],"vertices":[68,121],"hamiltonian,":[70],"still":[72],"open":[73],"in":[74],"general.":[75],"A":[76],"called":[79],"$(P_2\\cup":[80,114],"P_3)$-free":[81,115],"it":[83],"does":[84],"not":[85],"contain":[86],"any":[87],"induced":[88],"subgraph":[89],"isomorphic":[90],"$P_2\\cup":[92],"P_3$,":[93],"union":[95],"two":[97],"vertex-disjoint":[98],"paths":[99],"order":[101],"2":[102],"3,":[104],"respectively.":[105],"In":[106],"this":[107],"paper,":[108],"we":[109],"show":[110],"15-tough":[113],"hamiltonian.":[123]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}