Cite
HARVARD Citation
Bustamante, S. et al. (2019). Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles. Journal of graph theory. 91 (1), pp. 5-15. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Bustamante, S. et al. (2019). Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles. Journal of graph theory. 91 (1), pp. 5-15. [Online].