T. Araki, Dirac's Condition for Completely Independent Spanning Trees, Journal of Graph Theory, vol.312, issue.3, pp.171-179, 2014.
DOI : 10.1002/jgt.21780

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

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, 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.

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.

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.