A Note on the Degree Condition of Completely Independent Spanning Trees-Reference-Cited by-同舟云学术

A Note on the Degree Condition of Completely Independent Spanning Trees

Published:2015 Issue:10 Volume:E98.A Page:2191-2193
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

CHANG Hung-Yi¹,WANG Hung-Lung¹,YANG Jinn-Shyong²,CHANG Jou-Ming¹

Affiliation:

1. Institute of Information and Decision Sciences, National Taipei University of Business

2. Department of Information Management, National Taipei University of Business

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

https://www.jstage.jst.go.jp/article/transfun/E98.A/10/E98.A_2191/_pdf

Reference8 articles.

1. [1] T. Araki, “Dirac's condition for completely independent spanning trees,” J. Graph Theory, vol.77, no.3, pp.171-179, 2014.

2. [2] G. Fan, Y. Hong, and Q. Liu, “Ore's condition for completely independent spanning trees,” Discrete Appl. Math., vol.177, pp.95-100, 2014.

3. [3] T. Hasunuma, “Completely independent spanning trees in the underlying graph of a line digraph,” Discrete Math., vol.234, no.1-3, pp.149-157, 2001.

4. [4] T. Hasunuma, “Completely independent spanning trees in maximal planar graphs,” Proc. Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol.2573, pp.235-245, Springer Berlin Heidelberg, Berlin, Heidelberg, 2002.

5. [5] T. Hasunuma and C. Morisaka, “Completely independent spanning trees in torus networks,” Networks, vol.60, no.1, pp.59-69, 2012.

Cited by 29 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Independent Spanning Trees in Networks: A Survey;ACM Computing Surveys;2023-07-17

2. Completely independent spanning trees in some Cartesian product graphs;AIMS Mathematics;2023

3. Degree Conditions for Completely Independent Spanning Trees of Bipartite Graphs;Graphs and Combinatorics;2022-10-27

4. Completely Independent Spanning Trees on BCCC Data Center Networks With an Application to Fault-Tolerant Routing;IEEE Transactions on Parallel and Distributed Systems;2022-08-01

5. Construction of Dual-CISTs on an Infinite Class of Networks;IEEE Transactions on Parallel and Distributed Systems;2022-08-01