T. Araki, Dirac's Condition for Completely Independent Spanning Trees, Journal of Graph Theory, vol.312, issue.3, p.171179, 2014.
DOI : 10.1016/j.disc.2011.11.015

B. Barden, J. Davis, R. Libeskind-hadas, and W. Williams, On edge-disjoint spanning trees in hypercubes, Information Processing Letters, vol.70, issue.1, p.1316, 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, p.12781306, 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, Communications and Computer Sciences, vol.98, issue.10, p.21912196, 2015.
DOI : 10.1587/transfun.E98.A.2191

B. Cheng, J. Fan, and X. Jia, Dimensional-Permutation-Based Independent Spanning Trees in Bijective Connection Networks, IEEE Transactions on Parallel and Distributed Systems, vol.26, issue.1, p.4553, 2014.
DOI : 10.1109/TPDS.2014.2307871

B. Cheng, D. Wang, and J. Fan, Constructing completely independant spanning trees in crossed cubes, Discrete Applied Mathematics, vol.219, p.100109, 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, p.95100, 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, 2003.
DOI : 10.1016/S0305-0548(02)00117-X

Z. Ge and S. L. Hakimi, Disjoint rooted spanning trees with small depths in de Bruijn and Kautz graphs, SIAM Journal on Computing, vol.26, p.7992, 1997.

S. Guba and S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica, vol.20, p.374387, 1998.

B. L. Hartnell and D. F. , Connected Domatic Number in Planar Graphs, Czechoslovak Mathematical Journal, vol.51, issue.1, p.173179, 2001.
DOI : 10.1023/A:1013770108453
URL : http://dml.cz/bitstream/handle/10338.dmlcz/127636/CzechMathJ_51-2001-1_16.pdf

T. Hasunuma, Completely independent spanning trees in the underlying graph of line graph, Discrete mathematics, pp.234-149157, 2001.

T. Hasunuma and H. Nagamochi, Independent spanning trees with small depths in iterated line digraphs, Discrete Applied Mathematics, vol.110, issue.2-3, p.189211, 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, p.235245, 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, p.5669, 2012.
DOI : 10.1002/jgt.3190130205

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

S. T. Hedetniemi and R. Laskar, Connected domination in graphs, Graph Theory and Combinatorics, p.209217, 1984.

X. Hong and Q. Liu, Degree condition for completely independent spanning trees, Information Processing Letters, vol.116, issue.10, p.644648, 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-213221, 2003.

Y. Iwasaki, Y. Kajiwara, K. Obokata, and Y. Igarashi, Independent spanning trees of chordal rings, Information Processing Letters, vol.69, p.155160, 1999.

P. C. Li and M. Toulouse, Maximum leaf spanning tree problem for grid graphs, The Journal of Combinatorial Mathematics and Combinatorial Computing, vol.73, p.181193, 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, p.427437, 2015.

K. Obokata, Y. Iwasaki, F. Bao, and Y. Igarashi, Independent spanning trees in product graphs and their construction, IEICE Trans. E79-A, p.18941903, 1996.
DOI : 10.1007/3-540-62559-3_27

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, p.107113, 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, p.25142517, 2014.
DOI : 10.1587/transinf.2014EDL8079

K. Pai and J. Chang, Constructing two completely independant spanning trees in hypercube-variant networks, Theorical Computer Science, vol.652, p.2837, 2016.

F. Péterfalvi, Two counterexamples on completely independent spanning trees, Discrete Mathematics, vol.312, issue.4, pp.312-808810, 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, p.141149, 2004.

J. Yang, S. Tang, J. Chang, and Y. Wang, Parallel construction of optimal independent spanning trees on hypercubes, Parallel Computing, vol.33, issue.1, pp.33-7379, 2007.
DOI : 10.1016/j.parco.2006.12.001

J. Yang, M. Wu, J. Chang, and Y. Chang, A fully parallelized scheme of constructing independent spanning trees on Möbius cubes, The Journal of Supercomputing, vol.71, p.952965, 2015.

J. Yang, J. Chang, K. Pai, and H. Chan, Parallel Construction of Independent Spanning Trees on Enhanced Hypercubes, IEEE Transactions on Parallel and Distributed Systems, vol.26, issue.11, p.30903098, 2015.
DOI : 10.1109/TPDS.2014.2367498

B. Zelinka, Connected domatic Number of a graph, Czechoslovak Mathematical Journal, vol.36, p.387392, 1986.