{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T06:33:48Z","timestamp":1773988428674,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100006407","name":"Natural Science Foundation of Henan Province","doi-asserted-by":"publisher","award":["252300420335"],"award-info":[{"award-number":["252300420335"]}],"id":[{"id":"10.13039\/501100006407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006407","name":"Natural Science Foundation of Henan Province","doi-asserted-by":"publisher","award":["252300421493"],"award-info":[{"award-number":["252300421493"]}],"id":[{"id":"10.13039\/501100006407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.tcs.2026.115800","type":"journal-article","created":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T07:44:14Z","timestamp":1770104654000},"page":"115800","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The existence condition of k completely independent spanning tree for some graphs"],"prefix":"10.1016","volume":"1068","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-0491-0948","authenticated-orcid":false,"given":"Xia","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115800_bib0001","series-title":"Graph Theory","author":"Bondy","year":"2008"},{"key":"10.1016\/j.tcs.2026.115800_bib0002","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":"Discr. Math"},{"key":"10.1016\/j.tcs.2026.115800_bib0003","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","article-title":"Edge-disjoint spanning trees of finite graphs","volume":"36","author":"Nash-Williams","year":"1961","journal-title":"J. Lond. Math. Soc."},{"key":"10.1016\/j.tcs.2026.115800_bib0004","first-page":"231","article-title":"On the problems of decomposing a graph into n-connected factors","volume":"36","author":"Tutte","year":"1961","journal-title":"J. Lond. Math. Soc."},{"key":"10.1016\/j.tcs.2026.115800_bib0005","series-title":"Proceedings of 28Th Graph Theoretic Concepts of Computer Science","article-title":"Completely independent spanning trees in maximal planar graphs","volume":"2573","author":"Hasunuma","year":"2002"},{"key":"10.1016\/j.tcs.2026.115800_bib0006","series-title":"Two counterexamples on completely independent spanning trees","first-page":"808","author":"P\u00e9terfalvi","year":"2012"},{"key":"10.1016\/j.tcs.2026.115800_bib0007","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 Theor."},{"key":"10.1016\/j.tcs.2026.115800_bib0008","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":"Disc. Appl. Math"},{"key":"10.1016\/j.tcs.2026.115800_bib0009","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.tcs.2026.115800_bib0010","doi-asserted-by":"crossref","first-page":"2191","DOI":"10.1587\/transfun.E98.A.2191","article-title":"A note on the degree condition of completely independent spanning trees","volume":"98","author":"Chang","year":"2015","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E"},{"key":"10.1016\/j.tcs.2026.115800_bib0011","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/978-3-319-29516-9_22","article-title":"Minimum degree conditions and optimal graphs for completely independent spanning trees","volume":"9538","author":"Hasunuma","year":"2016","journal-title":"Lecture Notes in Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115800_bib0012","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1016\/j.ipl.2016.05.004","article-title":"Degree condition for completely independent spanning trees","volume":"116","author":"Hong","year":"2016","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2026.115800_bib0013","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1016\/j.dam.2025.04.051","article-title":"Completely independent spanning trees in k-th power of 2-connected graphs","volume":"372","author":"Hong","year":"2025","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115800_bib0014","series-title":"Two completely independent spanning trees of P4-free graphs","volume":"39","author":"Chen","year":"2023"},{"key":"10.1016\/j.tcs.2026.115800_bib0015","series-title":"Degree conditions for completely independent spanning trees of bipartite graphs","volume":"38","author":"Yuan","year":"2022"},{"key":"10.1016\/j.tcs.2026.115800_bib0016","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1109\/TC.2021.3077587","article-title":"Constructing completely independent spanning trees in a family of line-Graph-Based data center networks","volume":"71","author":"Wang","year":"2021","journal-title":"IEEE Trans. Comput"},{"key":"10.1016\/j.tcs.2026.115800_bib0017","doi-asserted-by":"crossref","first-page":"23","DOI":"10.55016\/ojs\/cdm.v19i2.62694","article-title":"Minimal gralphs for completely independent spanning trees and completely independent spanning trees in complete t-partite graph","volume":"19","author":"Hong","year":"2024","journal-title":"Contrib. Discr. Math."},{"key":"10.1016\/j.tcs.2026.115800_bib0018","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/s00373-023-02688-y","article-title":"Completely independent spanning trees in line graphs","volume":"39","author":"Hasunuma","year":"2023","journal-title":"Graph. Combinator."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000599?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000599?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T04:54:42Z","timestamp":1773982482000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526000599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":18,"alternative-id":["S0304397526000599"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115800","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The existence condition of k completely independent spanning tree for some graphs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115800","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115800"}}