Cite
HARVARD Citation
Duan, H. et al. (2016). The sufficiency of the divisibility condition for 6 × 2k divides complete tripartite graph K(m, n, s). Journal of discrete mathematical sciences & cryptography. pp. 447-456. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Duan, H. et al. (2016). The sufficiency of the divisibility condition for 6 × 2k divides complete tripartite graph K(m, n, s). Journal of discrete mathematical sciences & cryptography. pp. 447-456. [Online].