Cite
HARVARD Citation
NAGY, D. (n.d.). On the Number of 4-Edge Paths in Graphs With Given Edge Density. Combinatorics, probability and computing. pp. 431-447. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
NAGY, D. (n.d.). On the Number of 4-Edge Paths in Graphs With Given Edge Density. Combinatorics, probability and computing. pp. 431-447. [Online].