Computer Science ›› 2017, Vol. 44 ›› Issue (6): 9496.doi: 10.11896/j.issn.1002137X.2017.06.016
Previous Articles Next Articles
LIN Chengkuan, ZHAO Yuan, FAN Jianxi and CHENG Baolei
[1] CHANG H Y,WANG H L,YANG J S,et al.A note on the degree condition of completely independent spanning trees[J].IEICE Transactions on Fundamentals of Electronics,Communications and Computer Sciences,2015,8(10):21912193. [2] HSU L H,LN C K.Graph theory and interconnection networks[M].CRC press,2008. [3] HASUNUMA T.Completely independent spanning trees in the underlying graph of a linegraph[J].Discrete Math.,2001,4(13):149157. [4] HASUNUMA T.Completely independent spanning trees in maximal planar graphs[J].Proceedings of 28th Graph Theoretic Concepts of Computer Science (WG2002),2002,3:235245. [5] ARAKI T.Dirac’s condition for completely independent spanning trees[J].Graph Theor.,2014,7(3):171179. [6] FAN G,HONG Y,LIU Q.Ore’s condition for completely independent spanning trees[J].Discrete Appl.Math.,2014,7(177):95100. [7] ROSE K H.离散数学及其应用(第七版)[M].徐六福,等译.北京:机械工业出版社,2014:552. [8] PAI K J,TANG S M,CHANG J M,et al.Completely independent spanning trees on complete graphs,complete bipartite graphs and complete tripartite graphs[M]∥Advances in Intelligent Systems and ApplicationsVolume 1.Springer Berlin Heidelberg,2013:107113. 
No related articles found! 
