{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T22:08:26Z","timestamp":1768687706148,"version":"3.49.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,12]],"date-time":"2023-03-12T00:00:00Z","timestamp":1678579200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,12]],"date-time":"2023-03-12T00:00:00Z","timestamp":1678579200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Research Fund of the Doctoral Program of Liaoning Normal University","award":["2021BSL011"],"award-info":[{"award-number":["2021BSL011"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901268"],"award-info":[{"award-number":["11901268"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s00373-023-02622-2","type":"journal-article","created":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T22:07:19Z","timestamp":1679868439000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Two Completely Independent Spanning Trees of $$P_4$$-Free Graphs"],"prefix":"10.1007","volume":"39","author":[{"given":"Xiaodong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Jingjing","family":"Li","sequence":"additional","affiliation":[]},{"given":"Fuliang","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,12]]},"reference":[{"key":"2622_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1002\/jgt.21780","volume":"77","author":"T Araki","year":"2014","unstructured":"Araki, T.: Dirac\u2019s condition for completely independent spanning trees. J. Graph Theory 77, 171\u2013179 (2014)","journal-title":"J. Graph Theory"},{"key":"2622_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J Bondy","year":"1976","unstructured":"Bondy, J., Murty, U.: Graph Theory with Applications. American Elsevier, New York (1976)"},{"key":"2622_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.dam.2014.06.002","volume":"177","author":"G Fan","year":"2014","unstructured":"Fan, G., Hong, Y., Liu, Q.: Ore\u2019s condition for completely independent spanning trees. Discret. Appl. Math. 177, 95\u2013100 (2014)","journal-title":"Discret. Appl. Math."},{"key":"2622_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0012-365X(00)00377-0","volume":"234","author":"T Hasunuma","year":"2001","unstructured":"Hasunuma, T.: Completely independent spanning trees in the underlying graph of a line digraph. Discret. Math. 234, 149\u2013157 (2001)","journal-title":"Discret. Math."},{"key":"2622_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.20460","volume":"60","author":"T Hasunuma","year":"2012","unstructured":"Hasunuma, T., Morisaka, C.: Completely independent spanning trees in torus networks. Networks 60, 59\u201369 (2012)","journal-title":"Networks"},{"key":"2622_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0166-218X(00)00269-9","volume":"110","author":"T Hasunuma","year":"2001","unstructured":"Hasunuma, T., Nagamochi, H.: Independent spanning trees with small depths in iterated line digraphs. Discret. Appl. Math. 110, 189\u2013211 (2001)","journal-title":"Discret. Appl. Math."},{"key":"2622_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(88)90016-8","volume":"79","author":"A Itai","year":"1988","unstructured":"Itai, A., Rodeh, M.: The multi-tree approach to reliability in distributed networks. Inf. Comput. 79, 43\u201359 (1988)","journal-title":"Inf. Comput."},{"key":"2622_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0095-8956(78)90013-8","volume":"24","author":"HA Jung","year":"1978","unstructured":"Jung, H.A.: On a class of posets and the corresponding comparability graphs. J. Combin. Theory Ser. B 24, 125\u2013133 (1978)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2622_CR9","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.dam.2021.08.023","volume":"305","author":"J Li","year":"2021","unstructured":"Li, J., Su, G., Song, G.: New comments on \u201cA Hamilton sufficient condition for completely independent spanning tree\u2019\u2019. Discret. Appl. Math. 305, 10\u201315 (2021)","journal-title":"Discret. Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02622-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02622-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02622-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T17:05:32Z","timestamp":1681319132000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02622-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,12]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["2622"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02622-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,12]]},"assertion":[{"value":"29 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"30"}}