Cite
HARVARD Citation
PERARNAU, G. et al. (n.d.). Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree. Combinatorics, probability and computing. pp. 448-467. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
PERARNAU, G. et al. (n.d.). Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree. Combinatorics, probability and computing. pp. 448-467. [Online].