Cite
HARVARD Citation
Borozan, V. et al. (2016). Partitioning a Graph into Highly Connected Subgraphs. Journal of graph theory. 82 (3), pp. 322-333. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Borozan, V. et al. (2016). Partitioning a Graph into Highly Connected Subgraphs. Journal of graph theory. 82 (3), pp. 322-333. [Online].