Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Suen, W-C.S.
1985.
Random Graphs '83, Based on lectures presented at the 1st Poznań Seminar on Random Graphs.
Vol. 118,
Issue. ,
p.
263.
McDiarmid, Colin
1986.
On the greedy algorithm with random costs.
Mathematical Programming,
Vol. 36,
Issue. 3,
p.
245.
McDiarmid, Colin
1987.
Annals of Discrete Mathematics (33), Proceedings of the International Conference on Finite Geometries and Combinatorial Structures.
Vol. 144,
Issue. ,
p.
187.
Gould, Ronald J.
1991.
Updating the hamiltonian problem—A survey.
Journal of Graph Theory,
Vol. 15,
Issue. 2,
p.
121.
Wallace, Rodrick
1991.
Social disintegration and the spread of AIDS: Thresholds for propagation along ‘sociogeographic’ networks.
Social Science & Medicine,
Vol. 33,
Issue. 10,
p.
1155.
Frieze, Alan
and
Loh, Po‐Shen
2014.
Rainbow hamilton cycles in random graphs.
Random Structures & Algorithms,
Vol. 44,
Issue. 3,
p.
328.
Montgomery, Richard
2020.
Hamiltonicity in random directed graphs is born resilient.
Combinatorics, Probability and Computing,
Vol. 29,
Issue. 6,
p.
900.
Araujo, Igor
Balogh, József
Krueger, Robert
Piga, Simón
and
Treglown, Andrew
2023.
Cycles of every length and orientation in randomly perturbed digraphs.
p.
66.
Araujo, Igor
Balogh, József
Krueger, Robert A.
Piga, Simón
and
Treglown, Andrew
2024.
On oriented cycles in randomly perturbed digraphs.
Combinatorics, Probability and Computing,
Vol. 33,
Issue. 2,
p.
157.
Montgomery, Richard
2024.
Spanning cycles in random directed graphs.
Random Structures & Algorithms,
Vol. 65,
Issue. 3,
p.
535.