{"id":"https://openalex.org/W7162633453","doi":"https://doi.org/10.1016/j.dam.2026.05.028","title":"Completely independent spanning trees in split graphs: Structural properties and complexity","display_name":"Completely independent spanning trees in split graphs: Structural properties and complexity","publication_year":2026,"publication_date":"2026-05-28","ids":{"openalex":"https://openalex.org/W7162633453","doi":"https://doi.org/10.1016/j.dam.2026.05.028"},"language":"en","primary_location":{"id":"doi:10.1016/j.dam.2026.05.028","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.dam.2026.05.028","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.dam.2026.05.028","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003957795","display_name":"Mohammed Lalou","orcid":"https://orcid.org/0000-0002-8837-4351"},"institutions":[{"id":"https://openalex.org/I177064439","display_name":"Universit\u00e9 de Bourgogne","ror":"https://ror.org/03k1bsr36","country_code":"FR","type":"education","lineage":["https://openalex.org/I177064439"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mohammed Lalou","raw_affiliation_strings":["Universit\u00e9 Bourgogne Europe, LIB UR 7534, Dijon, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Bourgogne Europe, LIB UR 7534, Dijon, France","institution_ids":["https://openalex.org/I177064439"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072387034","display_name":"Nader Mbarek","orcid":"https://orcid.org/0000-0002-9274-6816"},"institutions":[{"id":"https://openalex.org/I177064439","display_name":"Universit\u00e9 de Bourgogne","ror":"https://ror.org/03k1bsr36","country_code":"FR","type":"education","lineage":["https://openalex.org/I177064439"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nader Mbarek","raw_affiliation_strings":["Universit\u00e9 Bourgogne Europe, LIB UR 7534, Dijon, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Bourgogne Europe, LIB UR 7534, Dijon, France","institution_ids":["https://openalex.org/I177064439"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137216579","display_name":"Abdallah Skender","orcid":"https://orcid.org/0009-0004-1046-8210"},"institutions":[{"id":"https://openalex.org/I177064439","display_name":"Universit\u00e9 de Bourgogne","ror":"https://ror.org/03k1bsr36","country_code":"FR","type":"education","lineage":["https://openalex.org/I177064439"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Abdallah Skender","raw_affiliation_strings":["Universit\u00e9 Bourgogne Europe, LIB UR 7534, Dijon, France"],"raw_orcid":"https://orcid.org/0009-0004-1046-8210","affiliations":[{"raw_affiliation_string":"Universit\u00e9 Bourgogne Europe, LIB UR 7534, Dijon, France","institution_ids":["https://openalex.org/I177064439"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045655458","display_name":"Olivier Togni","orcid":"https://orcid.org/0000-0001-9510-3595"},"institutions":[{"id":"https://openalex.org/I177064439","display_name":"Universit\u00e9 de Bourgogne","ror":"https://ror.org/03k1bsr36","country_code":"FR","type":"education","lineage":["https://openalex.org/I177064439"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Olivier Togni","raw_affiliation_strings":["Universit\u00e9 Bourgogne Europe, LIB UR 7534, Dijon, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Bourgogne Europe, LIB UR 7534, Dijon, France","institution_ids":["https://openalex.org/I177064439"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5137216579"],"corresponding_institution_ids":["https://openalex.org/I177064439"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":{"value":2750,"currency":"USD","value_usd":2750},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.94701567,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"391","issue":null,"first_page":"511","last_page":"522"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.7835000157356262,"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.7835000157356262,"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.07370000332593918,"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"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.06949999928474426,"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/hypergraph","display_name":"Hypergraph","score":0.8291000127792358},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7141000032424927},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5600000023841858},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44530001282691956},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4424999952316284},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.42320001125335693}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.9107999801635742},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8291000127792358},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7641000151634216},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7141000032424927},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5600000023841858},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44670000672340393},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44530001282691956},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4424999952316284},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.42320001125335693},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.3221000134944916},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.2757999897003174},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25609999895095825}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.dam.2026.05.028","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.dam.2026.05.028","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.dam.2026.05.028","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.dam.2026.05.028","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1480721107","https://openalex.org/W1963897549","https://openalex.org/W1967548269","https://openalex.org/W1974047440","https://openalex.org/W1997778928","https://openalex.org/W2007726983","https://openalex.org/W2077515067","https://openalex.org/W2155621353","https://openalex.org/W2162483260","https://openalex.org/W2972042994","https://openalex.org/W4205472884","https://openalex.org/W4307649332","https://openalex.org/W4362554158","https://openalex.org/W4384306217","https://openalex.org/W4417507089"],"related_works":[],"abstract_inverted_index":{"We":[0,20],"study":[1],"completely":[2],"independent":[3],"spanning":[4],"trees":[5,9],"(CIST),":[6],"i.e.":[7],",":[8],"that":[10,65],"are":[11],"both":[12],"edge-disjoint":[13],"and":[14,33,40,52],"internally":[15],"vertex-disjoint,":[16],"in":[17,29,74],"split":[18,31,76],"graphs.":[19],"establish":[21],"a":[22,30,75,83,90],"correspondence":[23],"between":[24],"the":[25,56,66,69,86,94,98],"existence":[26,70],"of":[27,36,43,58,68,71,89,100],"CIST":[28,73],"graph":[32,77],"some":[34],"types":[35],"hypergraph":[37,91],"colorings":[38],"(panchromatic":[39],"bipanchromatic":[41,87],"colorings)":[42],"its":[44],"associated":[45],"hypergraph,":[46],"allowing":[47],"us":[48],"to":[49,93],"obtain":[50],"lower":[51],"upper":[53],"bounds":[54],"on":[55,85],"number":[57,88,99],"CIST.":[59,101],"Using":[60],"these":[61],"relations,":[62],"we":[63,81],"prove":[64],"problem":[67],"two":[72],"is":[78],"NP-complete.":[79],"Finally,":[80],"formulate":[82],"conjecture":[84],"related":[92],"results":[95],"obtained":[96],"for":[97]},"counts_by_year":[],"updated_date":"2026-05-29T06:26:23.687440","created_date":"2026-05-29T00:00:00"}