Cite
HARVARD Citation
Ebsen, O. et al. (2020). Embedding spanning subgraphs in uniformly dense and inseparable graphs. Random structures & algorithms. 57 (4), pp. 1077-1096. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Ebsen, O. et al. (2020). Embedding spanning subgraphs in uniformly dense and inseparable graphs. Random structures & algorithms. 57 (4), pp. 1077-1096. [Online].