Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Cuckler, Bill
and
Kahn, Jeff
2009.
Hamiltonian cycles in Dirac graphs.
Combinatorica,
Vol. 29,
Issue. 3,
p.
299.
Cuckler, Bill
and
Kahn, Jeff
2009.
Entropy bounds for perfect matchings and Hamiltonian cycles.
Combinatorica,
Vol. 29,
Issue. 3,
p.
327.
Kühn, Daniela
and
Osthus, Deryk
2012.
A survey on Hamilton cycles in directed graphs.
European Journal of Combinatorics,
Vol. 33,
Issue. 5,
p.
750.
Ferber, Asaf
Kronenberg, Gal
and
Long, Eoin
2015.
Packing, Counting and Covering Hamilton cycles in random directed graphs.
Electronic Notes in Discrete Mathematics,
Vol. 49,
Issue. ,
p.
813.
YUSTER, RAPHAEL
2017.
On the Maximum Number of Spanning Copies of an Orientation in a Tournament.
Combinatorics, Probability and Computing,
Vol. 26,
Issue. 5,
p.
775.
Ferber, Asaf
Krivelevich, Michael
and
Sudakov, Benny
2017.
Counting and packing Hamilton cycles in dense graphs and oriented graphs.
Journal of Combinatorial Theory, Series B,
Vol. 122,
Issue. ,
p.
196.
Ferber, Asaf
Kronenberg, Gal
and
Long, Eoin
2017.
Packing, counting and covering Hamilton cycles in random directed graphs.
Israel Journal of Mathematics,
Vol. 220,
Issue. 1,
p.
57.
Sudakov, Benny
2017.
Surveys in Combinatorics 2017.
p.
372.
Pillai, Nagarajan Deivanayagam
Malayalan, Lathamaheswari
Broumi, Said
Smarandache, Florentin
and
Jacob, Kavikumar
2020.
Neutrosophic Graph Theory and Algorithms.
p.
107.
Yuster, Raphael
2022.
Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs.
Journal of Combinatorial Theory, Series B,
Vol. 153,
Issue. ,
p.
195.