B. Barden, J. Davis, R. Libeskind-hadas, and W. Williams, On edge-disjoint spanning trees in hypercubes, Information Processing Letters, vol.70, issue.1, pp.13-16, 1999.
DOI : 10.1016/S0020-0190(99)00033-2

D. M. Blough and H. Wang, Multicast in wormhole-switched torus networks using edge-disjoint spanning trees, Journal of Parallel and Distributed Computing, vol.61, pp.1278-1306, 2001.

H. Chang, H. Wang, J. Yang, and J. , Chang A note on the degree condition of completely independent spanning trees, IEICE Transactions on Fundamentals of Electronics, pp.2191-2196, 2015.

B. Cheng, D. Wang, and J. , Constructing completely independent spanning trees in crossed cubes, Discrete Applied Mathematics, vol.219, pp.100-109, 2017.
DOI : 10.1016/j.dam.2016.11.019

G. Fan, Y. Hong, and Q. Liu, Ore???s condition for completely independent spanning trees, Discrete Applied Mathematics, vol.177, pp.95-100, 2014.
DOI : 10.1016/j.dam.2014.06.002

T. Fujie, An exact algorithm for the maximum leaf spanning tree problem, Computers & Operations Research, vol.30, issue.13, pp.1931-1944, 2003.
DOI : 10.1016/S0305-0548(02)00117-X

Z. Ge and S. L. Hakimi, Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs, SIAM Journal on Computing, vol.26, issue.1, pp.79-92, 1997.
DOI : 10.1137/S0097539793244198

S. Guba and S. Khuller, Approximation Algorithms for Connected Dominating Sets, Algorithmica, vol.20, pp.374-387, 1998.

B. L. Hartnell and D. F. , Connected Domatic Number in Planar Graphs, Czechoslovak Mathematical Journal, vol.51, issue.1, pp.173-179, 2001.
DOI : 10.1023/A:1013770108453

T. Hasunuma, Completely independent spanning trees in the underlying graph of a line digraph, Discrete Mathematics, vol.234, issue.1-3, pp.234-149, 2001.
DOI : 10.1016/S0012-365X(00)00377-0

T. Hasunuma and H. Nagamochi, Independent spanning trees with small depths in iterated line digraphs, Discrete Applied Mathematics, vol.110, issue.2-3, pp.189-211, 2001.
DOI : 10.1016/S0166-218X(00)00269-9

T. Hasunuma, Completely Independent Spanning Trees in Maximal Planar Graphs, Lecture Notes in Computer Science, vol.2573, pp.235-245, 2002.
DOI : 10.1007/3-540-36379-3_21

T. Hasunuma and C. Morisaka, Completely independent spanning trees in torus networks, Networks, vol.13, issue.1, pp.56-69, 2012.
DOI : 10.1002/net.20460

T. Hasunuma, Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees, Lecture Notes in Computer Science, vol.9538, pp.260-273, 2016.
DOI : 10.1007/978-3-319-29516-9_22

S. T. Hedetniemi and R. Laskar, Connected domination in graphs, Graph Theory and Combinatorics, pp.209-217, 1984.

X. Hong and Q. Liu, Degree condition for completely independent spanning trees, Information Processing Letters, vol.116, issue.10, pp.644-648, 2016.
DOI : 10.1016/j.ipl.2016.05.004

T. Hung, S. Ku, and B. Wang, Constructing edge-disjoint spanning trees in product networks, Parallel and Distributed Systems, pp.61-213, 2003.

Y. Iwasaki, Y. Kajiwara, K. Obokata, and Y. Igarashi, Independent spanning trees of chordal rings, Information Processing Letters, vol.69, issue.3, pp.155-160, 1999.
DOI : 10.1016/S0020-0190(98)00205-1

P. C. Li and M. Toulouse, Maximum Leaf Spanning Tree Problem for Grid Graphs, The Journal of Combinatorial Mathematics and Combinatorial Computing, vol.73, pp.181-193, 2010.
DOI : 10.1016/j.ipl.2005.10.011

M. Matsushita, Y. Otachi, and T. Araki, Completely independent spanning trees in (partial) k-trees, Discussiones Mathematicae Graph Theory, vol.35, pp.427-437, 2015.

K. Obokata, Y. Iwasaki, F. Bao, and Y. Igarashi, Independent spanning trees in product graphs and their construction, IEICE Trans. E79-A, pp.1894-1903, 1996.

K. Pai, S. Tang, J. Chang, and J. Yang, Completely Independent Spanning Trees on Complete Graphs, Complete Bipartite Graphs and Complete Tripartite Graphs, Advances in Intelligent Systems and Applications, pp.107-113, 2013.
DOI : 10.1007/978-3-642-35452-6_13

K. Pai, J. Yang, S. Yao, S. Tang, and J. Chang, Completely Independent Spanning Trees on Some Interconnection Networks, IEICE Transactions on Information and Systems, vol.97, issue.9, pp.2514-2517, 2014.
DOI : 10.1587/transinf.2014EDL8079

K. Pai and J. Chang, Constructing two completely independent spanning trees in hypercube-variant networks, Theoretical Computer Science, vol.652, pp.28-37, 2016.
DOI : 10.1016/j.tcs.2016.08.024

F. Péterfalvi, Two counterexamples on completely independent spanning trees, Discrete Mathematics, vol.312, issue.4, pp.808-810, 2012.
DOI : 10.1016/j.disc.2011.11.015

P. Wan, K. M. Alzoubi, and O. Frieder, Distributed construction of connected dominating set in wireless ad hoc networks, Mobile Networks and Applications -Discrete algorithms and methods for mobile computing, pp.141-149, 2004.

B. Zelinka, Connected domatic Number of a graph, Czechoslovak Mathematical Journal, vol.36, pp.387-392, 1986.