{"id":"https://openalex.org/W7138290556","doi":"https://doi.org/10.1109/access.2026.3674987","title":"On Paired 2-Disjoint Path Coverability of Johnson and Generalized Johnson Graphs","display_name":"On Paired 2-Disjoint Path Coverability of Johnson and Generalized Johnson Graphs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7138290556","doi":"https://doi.org/10.1109/access.2026.3674987"},"language":"en","primary_location":{"id":"doi:10.1109/access.2026.3674987","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3674987","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2026.3674987","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053644047","display_name":"Jung-Heum Park","orcid":"https://orcid.org/0000-0002-1052-5746"},"institutions":[{"id":"https://openalex.org/I4210133166","display_name":"The Catholic University of Korea Bucheon St. Mary's Hospital","ror":"https://ror.org/0443jbw36","country_code":"KR","type":"healthcare","lineage":["https://openalex.org/I4210133166","https://openalex.org/I4405260414","https://openalex.org/I87111246"]},{"id":"https://openalex.org/I87111246","display_name":"Catholic University of Korea","ror":"https://ror.org/01fpnj063","country_code":"KR","type":"education","lineage":["https://openalex.org/I87111246"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Jung-Heum Park","raw_affiliation_strings":["School of Computer Science and Information Engineering, The Catholic University of Korea, Bucheon, Gyeonggi, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Information Engineering, The Catholic University of Korea, Bucheon, Gyeonggi, Republic of Korea","institution_ids":["https://openalex.org/I87111246","https://openalex.org/I4210133166"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5053644047"],"corresponding_institution_ids":["https://openalex.org/I4210133166","https://openalex.org/I87111246"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.85395865,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":null,"first_page":"42366","last_page":"42380"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.7069000005722046,"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.7069000005722046,"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.18310000002384186,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.03009999915957451,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/path","display_name":"Path (computing)","score":0.6137999892234802},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.30869999527931213},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.2892000079154968},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.2838999927043915},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.2800000011920929}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6137999892234802},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48890000581741333},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44179999828338623},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4189999997615814},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37689998745918274},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.30869999527931213},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2892000079154968},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2838999927043915},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2685999870300293},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.26510000228881836},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.26109999418258667},{"id":"https://openalex.org/C2988995629","wikidata":"https://www.wikidata.org/wiki/Q2915729","display_name":"Matrix algebra","level":3,"score":0.25609999895095825}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2026.3674987","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3674987","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:ef266b6e16a04b408a5c031feadfcada","is_oa":true,"landing_page_url":"https://doaj.org/article/ef266b6e16a04b408a5c031feadfcada","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 14, Pp 42366-42380 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2026.3674987","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3674987","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Climate action","id":"https://metadata.un.org/sdg/13","score":0.4331148862838745}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"specified":[1],"disjoint":[2],"sets":[3],"of":[4,36,54,81,106,135,188],"sources":[5],"and":[6,16,88,122,163,183],"sinks,":[7],"<inline-formula>":[8,17,27,37,43,59,64,69,84,92,102,127],"<tex-math":[9,18,28,38,44,60,65,70,85,93,103,128],"notation=\"LaTeX\">$S":[10],"=":[11,20],"\\{s_{1},":[12],"\\ldots,":[13,22,46],"s_{k}\\}$":[14],"</tex-math></inline-formula>":[15,40,62,67,87,105],"notation=\"LaTeX\">$T":[19],"\\{t_{1},":[21],"t_{k}\\}$":[23],"</tex-math></inline-formula>,":[24,48,130],"a":[25,34,148,158,173,179],"paired":[26,77,112,164],"notation=\"LaTeX\">$k$":[29,39],"</tex-math></inline-formula>-disjoint":[30],"path":[31,79,114,166],"cover":[32],"is":[33,147],"collection":[35],"vertex-disjoint":[41],"paths,":[42],"notation=\"LaTeX\">$\\{P_{1},":[45],"P_{k}\\}$":[47],"that":[49,98,119,152],"together":[50],"span":[51],"all":[52,99,120],"vertices":[53],"the":[55,76,132,136,185],"graph,":[56,138],"where":[57],"each":[58],"notation=\"LaTeX\">$P_{i}$":[61],"connects":[63],"notation=\"LaTeX\">$s_{i}$":[66],"to":[68],"notation=\"LaTeX\">$t_{i}$":[71],"</tex-math></inline-formula>.":[72,95],"This":[73,176],"paper":[74],"investigates":[75],"2-disjoint":[78,113,165],"coverability":[80,167],"Johnson":[82,90,100,125],"graphs":[83,91,101,126],"notation=\"LaTeX\">$J(n,p)$":[86,104],"generalized":[89,124],"notation=\"LaTeX\">$J(n,p,q)$":[94],"We":[96],"prove":[97],"order":[107],"at":[108],"least":[109],"four":[110],"are":[111],"coverable.":[115],"Furthermore,":[116],"we":[117],"demonstrate":[118],"nontrivial":[121],"connected":[123],"notation=\"LaTeX\">$J(n,p,p-2)$":[129],"with":[131],"sole":[133],"exception":[134],"Petersen":[137],"also":[139],"possess":[140],"this":[141],"property.":[142],"The":[143],"main":[144],"technical":[145],"ingredient":[146],"structural":[149,186],"partition":[150],"theorem":[151],"provides":[153],"sufficient":[154],"conditions":[155],"under":[156],"which":[157],"graph":[159],"inherits":[160],"1-vertex-fault":[161],"Hamiltonian-connectivity":[162],"from":[168],"two":[169],"induced":[170],"subgraphs":[171],"forming":[172],"vertex":[174],"partition.":[175],"framework":[177],"enables":[178],"recursive":[180],"decomposition":[181],"approach":[182],"clarifies":[184],"basis":[187],"these":[189],"strong":[190],"Hamiltonian":[191],"properties.":[192]},"counts_by_year":[],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2026-03-18T00:00:00"}