Cite
HARVARD Citation
Lee, C. (2020). The complexity of total k-domatic partition and total R-domination on graphs with weak elimination orderings. International journal of computer mathematics. 5 (3), pp. 134-147. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Lee, C. (2020). The complexity of total k-domatic partition and total R-domination on graphs with weak elimination orderings. International journal of computer mathematics. 5 (3), pp. 134-147. [Online].