{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:55:00Z","timestamp":1781463300425,"version":"3.54.1"},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T00:00:00Z","timestamp":1779753600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.05.028","type":"journal-article","created":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T07:02:35Z","timestamp":1779951755000},"page":"511-522","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Completely independent spanning trees in split graphs: Structural properties and complexity"],"prefix":"10.1016","volume":"391","author":[{"given":"Mohammed","family":"Lalou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nader","family":"Mbarek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-1046-8210","authenticated-orcid":false,"given":"Abdallah","family":"Skender","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Olivier","family":"Togni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.dam.2026.05.028_b1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1002\/jgt.21780","article-title":"Dirac\u2019s condition for completely independent spanning trees","volume":"77","author":"Araki","year":"2014","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/j.dam.2026.05.028_b2","doi-asserted-by":"crossref","first-page":"427","DOI":"10.7151\/dmgt.1806","article-title":"Completely independent spanning trees in (partial) k-trees","volume":"35","author":"Araki","year":"2015","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2026.05.028_b3","series-title":"Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks","first-page":"472","article-title":"Reliable broadcasting and secure distributing in channel networks","author":"Bao","year":"1997"},{"key":"10.1016\/j.dam.2026.05.028_b4","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.dam.2023.07.001","article-title":"Two completely independent spanning trees of split graphs","volume":"340","author":"Chen","year":"2023","journal-title":"Discrete Appl. Math."},{"issue":"14S","key":"10.1016\/j.dam.2026.05.028_b5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3591110","article-title":"Independent spanning trees in networks: A survey","volume":"55","author":"Cheng","year":"2023","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.dam.2026.05.028_b6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.dam.2014.06.002","article-title":"Ore\u2019s condition for completely independent spanning trees","volume":"177","author":"Fan","year":"2014","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.05.028_b7","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/j.dam.2026.05.028_b8","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0012-365X(00)00377-0","article-title":"Completely independent spanning trees in the underlying graph of a line digraph","volume":"234","author":"Hasunuma","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.05.028_b9","series-title":"Graph-Theoretic Concepts in Computer Science","first-page":"235","article-title":"Completely independent spanning trees in maximal planar graphs","author":"Hasunuma","year":"2002"},{"issue":"1","key":"10.1016\/j.dam.2026.05.028_b10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.20460","article-title":"Completely independent spanning trees in torus networks","volume":"60","author":"Hasunuma","year":"2012","journal-title":"Networks"},{"key":"10.1016\/j.dam.2026.05.028_b11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.dam.2019.08.013","article-title":"A Hamilton sufficient condition for completely independent spanning tree","volume":"279","author":"Hong","year":"2020","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.05.028_b12","series-title":"More Sets, Graphs and Numbers: A Salute to Vera S\u00f3s and Andr\u00e1s Hajnal","first-page":"175","article-title":"Color-critical graphs and hypergraphs with few edges: A survey","author":"Kostochka","year":"2006"},{"key":"10.1016\/j.dam.2026.05.028_b13","series-title":"Parallel and Distributed Computing, Applications and Technologies","first-page":"94","article-title":"Construction of completely independent spanning tree based on vertex degree","author":"Liu","year":"2021"},{"key":"10.1016\/j.dam.2026.05.028_b14","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2025.115718","article-title":"Fan-type condition for two completely independent spanning trees","author":"Ma","year":"2026","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2026.05.028_b15","series-title":"2017 IEEE 13th International Conference on Wireless and Mobile Computing, Networking and Communications","first-page":"63","article-title":"Completely independent spanning trees for enhancing the robustness in ad-hoc networks","author":"Moinet","year":"2017"},{"key":"10.1016\/j.dam.2026.05.028_b16","series-title":"Advances in Intelligent Systems and Applications - Volume 1","first-page":"107","article-title":"Completely independent spanning trees on complete graphs, complete bipartite graphs and complete tripartite graphs","author":"Pai","year":"2013"},{"issue":"9","key":"10.1016\/j.dam.2026.05.028_b17","doi-asserted-by":"crossref","first-page":"2514","DOI":"10.1587\/transinf.2014EDL8079","article-title":"Completely independent spanning trees on some interconnection networks","volume":"E97-D","author":"Pai","year":"2014","journal-title":"IEICE Trans. Inf."},{"issue":"4","key":"10.1016\/j.dam.2026.05.028_b18","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1016\/j.disc.2011.11.015","article-title":"Two counterexamples on completely independent spanning trees","volume":"312","author":"P\u00e9terfalvi","year":"2012","journal-title":"Discrete Math."},{"issue":"8","key":"10.1016\/j.dam.2026.05.028_b19","doi-asserted-by":"crossref","first-page":"1902","DOI":"10.1109\/TPDS.2021.3132412","article-title":"Construction of dual-CISTs on an infinite class of networks","volume":"33","author":"Qin","year":"2022","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"5","key":"10.1016\/j.dam.2026.05.028_b20","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1070\/RM2011v066n05ABEH004764","article-title":"The Erd\u0151s\u2013Hajnal problem of hypergraph colouring, its generalizations, and related problems","volume":"66","author":"Raigorodskii","year":"2011","journal-title":"Russian Math. Surveys"},{"issue":"1","key":"10.1016\/j.dam.2026.05.028_b21","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/71.744837","article-title":"Efficient broadcasting in wormhole-routed multicomputers: a network-partitioning approach","volume":"10","author":"Tseng","year":"1999","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"6","key":"10.1016\/j.dam.2026.05.028_b22","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s00373-022-02585-w","article-title":"Degree conditions for completely independent spanning trees of bipartite graphs","volume":"38","author":"Yuan","year":"2022","journal-title":"Graphs Combin."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26003112?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26003112?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:07:23Z","timestamp":1781460443000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26003112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":22,"alternative-id":["S0166218X26003112"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.028","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Completely independent spanning trees in split graphs: Structural properties and complexity","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.028","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}