{"id":"https://openalex.org/W3207048296","doi":"https://doi.org/10.1142/s0129054121500337","title":"Hamiltonian Cycle in K1,r-Free Split Graphs \u2014 A Dichotomy","display_name":"Hamiltonian Cycle in K1,r-Free Split Graphs \u2014 A Dichotomy","publication_year":2021,"publication_date":"2021-10-20","ids":{"openalex":"https://openalex.org/W3207048296","doi":"https://doi.org/10.1142/s0129054121500337","mag":"3207048296"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054121500337","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054121500337","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5005298039","display_name":"P. Renjith","orcid":null},"institutions":[{"id":"https://openalex.org/I26072440","display_name":"Indian Institute of Information Technology Allahabad","ror":"https://ror.org/03rgjt374","country_code":"IN","type":"education","lineage":["https://openalex.org/I26072440"]},{"id":"https://openalex.org/I4387155923","display_name":"Indian Institute of Information Technology Design and Manufacturing, Kurnool","ror":"https://ror.org/01kw6bd80","country_code":null,"type":"education","lineage":["https://openalex.org/I4387155923"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"P. Renjith","raw_affiliation_strings":["Indian Institute of Information Technology, Design and Manufacturing, Kurnool, India"],"raw_orcid":"https://orcid.org/0000-0002-4934-4571","affiliations":[{"raw_affiliation_string":"Indian Institute of Information Technology, Design and Manufacturing, Kurnool, India","institution_ids":["https://openalex.org/I26072440","https://openalex.org/I4387155923"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075479783","display_name":"N. Sadagopan","orcid":null},"institutions":[{"id":"https://openalex.org/I39244652","display_name":"Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram","ror":"https://ror.org/023c9pb11","country_code":"IN","type":"education","lineage":["https://openalex.org/I39244652"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"N. Sadagopan","raw_affiliation_strings":["Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram, India","institution_ids":["https://openalex.org/I39244652"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005298039"],"corresponding_institution_ids":["https://openalex.org/I26072440","https://openalex.org/I4387155923"],"apc_list":null,"apc_paid":null,"fwci":0.757,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76244517,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"33","issue":"01","first_page":"1","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"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/T12288","display_name":"Optimization and Search Problems","score":0.9923999905586243,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.8843371272087097},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.7643116116523743},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7178177237510681},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6624480485916138},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6188442707061768},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.6146659851074219},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.5753396153450012},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5103487372398376},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4897291958332062},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.43413281440734863},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4151933789253235},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35505127906799316},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2619927227497101},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.06562003493309021}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.8843371272087097},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.7643116116523743},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7178177237510681},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6624480485916138},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6188442707061768},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6146659851074219},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.5753396153450012},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5103487372398376},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4897291958332062},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.43413281440734863},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4151933789253235},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35505127906799316},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2619927227497101},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.06562003493309021}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054121500337","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054121500337","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4618719349","display_name":null,"funder_award_id":"ECR/2017/001442","funder_id":"https://openalex.org/F4320334771","funder_display_name":"Science and Engineering Research Board"}],"funders":[{"id":"https://openalex.org/F4320334771","display_name":"Science and Engineering Research Board","ror":"https://ror.org/03ffdsr55"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W415832010","https://openalex.org/W1970185482","https://openalex.org/W1971556138","https://openalex.org/W1975951388","https://openalex.org/W1989983876","https://openalex.org/W1996311100","https://openalex.org/W1996899555","https://openalex.org/W2008676475","https://openalex.org/W2028363955","https://openalex.org/W2029275994","https://openalex.org/W2042947231","https://openalex.org/W2053623386","https://openalex.org/W2054643041","https://openalex.org/W2055130189","https://openalex.org/W2069397859","https://openalex.org/W2087818742","https://openalex.org/W2090118375","https://openalex.org/W2096036356","https://openalex.org/W2096399406","https://openalex.org/W2110444610","https://openalex.org/W2132624129","https://openalex.org/W2397396903","https://openalex.org/W2529351937","https://openalex.org/W2809247842","https://openalex.org/W4210762532"],"related_works":["https://openalex.org/W1618127724","https://openalex.org/W4387272283","https://openalex.org/W2768859505","https://openalex.org/W2256329187","https://openalex.org/W2952856011","https://openalex.org/W2046852387","https://openalex.org/W2036803675","https://openalex.org/W1541834747","https://openalex.org/W2127206007","https://openalex.org/W2969955840"],"abstract_inverted_index":{"For":[0],"an":[1,42],"optimization":[2],"problem":[3,38,125],"known":[4],"to":[5,15,74,117],"be":[6,115],"NP-Hard,":[7],"the":[8,12,17,34,107],"dichotomy":[9,44,120],"study":[10],"investigates":[11],"reduction":[13],"instances":[14,24],"determine":[16],"line":[18],"separating":[19],"polynomial-time":[20,89],"solvable":[21],"vs":[22,26],"NP-Hard":[23],"(easy":[25],"hard":[27],"instances).":[28],"In":[29],"this":[30,72,112],"paper,":[31],"we":[32,87],"investigate":[33],"well-studied":[35],"Hamiltonian":[36,92,123,130],"cycle":[37,93,131],"(HCYCLE),":[39],"and":[40,98,126],"present":[41,88],"interesting":[43],"result":[45,73,121],"on":[46,60],"split":[47,84,102],"graphs.":[48,85,103],"T.":[49],"Akiyama":[50],"et":[51],"al.":[52],"(1980)":[53],"have":[54],"shown":[55],"that":[56,76,106],"HCYCLE":[57,77],"is":[58,78],"NP-complete":[59,79],"planar":[61],"bipartite":[62],"graphs":[63],"with":[64],"maximum":[65],"degree":[66],"[Formula:":[67,81,95,99],"see":[68,82,96,100],"text].":[69],"We":[70,104],"use":[71],"show":[75,118],"for":[80,91,122],"text]-free":[83,97,101],"Further,":[86],"algorithms":[90],"in":[94,111],"believe":[105],"structural":[108],"results":[109],"presented":[110],"paper":[113],"can":[114],"used":[116],"similar":[119],"path":[124],"other":[127],"variants":[128],"of":[129],"(path)":[132],"problems.":[133]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}