{"id":"https://openalex.org/W7171958032","doi":"https://doi.org/10.48550/arxiv.2607.27802","title":"Short Cycles Decide P-versus-NPC Status ofHamiltonicity on Bisplit Graphs","display_name":"Short Cycles Decide P-versus-NPC Status ofHamiltonicity on Bisplit Graphs","publication_year":2026,"publication_date":"2026-07-30","ids":{"openalex":"https://openalex.org/W7171958032","doi":"https://doi.org/10.48550/arxiv.2607.27802"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.27802","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.27802","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.27802","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5144147574","display_name":"Mahendra Kumar R","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R, Mahendra Kumar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5144108705","display_name":"Renjith P","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P, Renjith","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5144135997","display_name":"Aadhavan S","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S, Aadhavan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5144112707","display_name":"Sadagopan N","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"N, Sadagopan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"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.9261999726295471,"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.9261999726295471,"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.02850000001490116,"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.007199999876320362,"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/chordal-graph","display_name":"Chordal graph","score":0.8360000252723694},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7886000275611877},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.6430000066757202},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.6277999877929688},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.564300000667572},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.5339000225067139},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.48089998960494995},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.46939998865127563}],"concepts":[{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.8360000252723694},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7886000275611877},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7612000107765198},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7608000040054321},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.6430000066757202},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.6277999877929688},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.564300000667572},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.5339000225067139},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49399998784065247},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.48089998960494995},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.46939998865127563},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.42910000681877136},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.3806000053882599},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3393999934196472},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.3312000036239624},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.30070000886917114},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.29510000348091125},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.29350000619888306},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.29019999504089355},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2766999900341034},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.26660001277923584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.27802","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.27802","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.27802","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.27802","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"connected":[1],"graph":[2,10],"G":[3,16],"is":[4,62,76],"said":[5],"to":[6],"be":[7,18],"a":[8,21,25,103],"bisplit":[9,41,58],"if":[11],"the":[12,31,37,67],"vertex":[13],"set":[14,23],"of":[15,69,111],"can":[17],"partitioned":[19],"into":[20],"stable":[22],"and":[24,46,54,71,87,109],"complete":[26],"bipartite":[27,57,82,92],"graph.":[28],"We":[29,64],"establish":[30],"following":[32],"dichotomy":[33],"with":[34],"chordality":[35],"being":[36],"parameter;":[38],"for":[39,55],"chordal":[40,56,81,91],"graphs,":[42,59],"Hamiltonian":[43,47],"cycle":[44],"(HCYCLE)":[45],"path":[48],"(HPATH)":[49,61,75,101],"problems":[50],"are":[51,115],"polynomial-time":[52,77],"solvable,":[53],"HCYCLE":[60,74,100,112],"NP-complete.":[63],"further":[65],"strengthen":[66],"result":[68],"[1]":[70],"show":[72],"that":[73],"solvable":[78],"on":[79,89,99],"P5-free":[80],"graphs":[83],"(bipartite":[84],"chain":[85],"graphs)":[86],"NP-complete":[88],"P10-free":[90],"graphs.":[93],"By":[94],"using":[95],"our":[96],"polynomial":[97],"results":[98],"as":[102],"framework,":[104],"we":[105],"solve":[106],"many":[107],"variants":[108],"generalizations":[110],"(HPATH),":[113],"which":[114],"also":[116],"reported":[117],"in":[118],"this":[119],"paper.":[120]},"counts_by_year":[],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2026-08-01T00:00:00"}