Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Koml�s, J�nos
S�rk�zy, G�bor N.
and
Szemer�di, Endre
1997.
Blow-up Lemma.
Combinatorica,
Vol. 17,
Issue. 1,
p.
109.
Komlós, János
Sárközy, Gábor N.
and
Szemerédi, Endre
1998.
Proof of the Seymour conjecture for large graphs.
Annals of Combinatorics,
Vol. 2,
Issue. 1,
p.
43.
Fischer, Eldar
1999.
Cycle factors in dense graphs.
Discrete Mathematics,
Vol. 197-198,
Issue. ,
p.
309.
Komlós, János
Shokoufandeh, Ali
Simonovits, Miklós
and
Szemerédi, Endre
2002.
Theoretical Aspects of Computer Science.
Vol. 2292,
Issue. ,
p.
84.
Ishigami, Yoshiyasu
2002.
Almost-Spanning Subgraphs with Bounded Degree in Dense Graphs.
European Journal of Combinatorics,
Vol. 23,
Issue. 5,
p.
583.
Kohayakawa, Y.
and
Rödl, V.
2003.
Recent Advances in Algorithms and Combinatorics.
p.
289.
Sárközy, Gábor N.
2008.
On 2-factors with k components.
Discrete Mathematics,
Vol. 308,
Issue. 10,
p.
1962.
Sárközy, Gábor N.
and
Selkow, Stanley
2008.
Distributing vertices along a Hamiltonian cycle in Dirac graphs.
Discrete Mathematics,
Vol. 308,
Issue. 23,
p.
5757.
Csaba, Béla
2008.
On embedding well-separable graphs.
Discrete Mathematics,
Vol. 308,
Issue. 19,
p.
4322.
Sárközy, Gábor N.
2009.
A fast parallel algorithm for finding Hamiltonian cycles in dense graphs.
Discrete Mathematics,
Vol. 309,
Issue. 6,
p.
1611.
Csaba, Béla
Nagy-György, Judit
Levitt, Ian
and
Szemerédi, Endre
2010.
Fete of Combinatorics and Computer Science.
Vol. 20,
Issue. ,
p.
95.
Balogh, József
Csaba, Béla
and
Samotij, Wojciech
2011.
Local resilience of almost spanning trees in random graphs.
Random Structures & Algorithms,
Vol. 38,
Issue. 1-2,
p.
121.
Szemerédi, Endre
2013.
Colloquium De Giorgi 2010–2012.
p.
17.
Clemens, Dennis
Ferber, Asaf
Glebov, Roman
Hefetz, Dan
and
Liebenau, Anita
2015.
Building Spanning Trees Quickly in Maker-Breaker Games.
SIAM Journal on Discrete Mathematics,
Vol. 29,
Issue. 3,
p.
1683.
Böttcher, Julia
Kohayakawa, Yoshiharu
Taraz, Anusch
and
Würfl, Andreas
2015.
An Extension of the Blow-up Lemma to Arrangeable Graphs.
SIAM Journal on Discrete Mathematics,
Vol. 29,
Issue. 2,
p.
962.
Krivelevich, Michael
Kwan, Matthew
and
Sudakov, Benny
2017.
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs.
SIAM Journal on Discrete Mathematics,
Vol. 31,
Issue. 1,
p.
155.
Böttcher, Julia
2017.
Surveys in Combinatorics 2017.
p.
87.
Mycroft, Richard
and
Naia, Tássio
2019.
Spanning Trees of Dense Directed Graphs.
Electronic Notes in Theoretical Computer Science,
Vol. 346,
Issue. ,
p.
645.
Simonovits, Miklós
and
Szemerédi, Endre
2019.
Building Bridges II.
Vol. 28,
Issue. ,
p.
445.
Condon, Padraig
Kim, Jaehoon
Kühn, Daniela
and
Osthus, Deryk
2019.
A bandwidth theorem for approximate decompositions.
Proceedings of the London Mathematical Society,
Vol. 118,
Issue. 6,
p.
1393.