Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Balogh, József
Barát, János
Gerbner, Dániel
Gyárfás, András
and
Sárközy, Gábor N.
2014.
Partitioning 2-edge-colored graphs by monochromatic paths and cycles.
Combinatorica,
Vol. 34,
Issue. 5,
p.
507.
Ahmed, Nasr
2015.
Recurrence of Space-Time Events.
Journal of Modern Physics,
Vol. 06,
Issue. 13,
p.
1793.
Barát, János
and
Sárközy, Gábor N.
2016.
Partitioning 2‐Edge‐Colored Ore‐Type Graphs by Monochromatic Cycles.
Journal of Graph Theory,
Vol. 81,
Issue. 4,
p.
317.
LETZTER, SHOHAM
2016.
Path Ramsey Number for Random Graphs.
Combinatorics, Probability and Computing,
Vol. 25,
Issue. 4,
p.
612.
Barát, János
Gyárfás, András
Lehel, Jenő
and
Sárközy, Gábor N.
2016.
Ramsey number of paths and connected matchings in Ore-type host graphs.
Discrete Mathematics,
Vol. 339,
Issue. 6,
p.
1690.
DeBiasio, Louis
and
Nelsen, Luke L.
2017.
Monochromatic cycle partitions of graphs with large minimum degree.
Journal of Combinatorial Theory, Series B,
Vol. 122,
Issue. ,
p.
634.
White, Matthew
2017.
The Monochromatic Circumference of 2‐Edge‐Colored Graphs.
Journal of Graph Theory,
Vol. 85,
Issue. 1,
p.
133.
CZYGRINOW, ANDRZEJ
DEBIASIO, LOUIS
MOLLA, THEODORE
and
TREGLOWN, ANDREW
2018.
TILING DIRECTED GRAPHS WITH TOURNAMENTS.
Forum of Mathematics, Sigma,
Vol. 6,
Issue. ,
DeBiasio, Louis
and
McKenney, Paul
2019.
Density of Monochromatic Infinite Subgraphs.
Combinatorica,
Vol. 39,
Issue. 4,
p.
847.
Rahimi, Zahra
2020.
Large monochromatic components in 3-colored non-complete graphs.
Journal of Combinatorial Theory, Series A,
Vol. 175,
Issue. ,
p.
105256.
Balogh, József
Kostochka, Alexandr
Lavrov, Mikhail
and
Liu, Xujun
2020.
Long monochromatic paths and cycles in 2-edge-colored multipartite graphs.
Moscow Journal of Combinatorics and Number Theory,
Vol. 9,
Issue. 1,
p.
55.
Łuczak, Tomasz
and
Rahimi, Zahra
2020.
On Schelp's problem for three odd long cycles.
Journal of Combinatorial Theory, Series B,
Vol. 143,
Issue. ,
p.
1.
DeBiasio, Louis
and
Krueger, Robert A.
2020.
Long monochromatic paths and cycles in 2-colored bipartite graphs.
Discrete Mathematics,
Vol. 343,
Issue. 8,
p.
111907.
Jenssen, Matthew
and
Skokan, Jozef
2021.
Exact Ramsey numbers of odd cycles via nonlinear optimisation.
Advances in Mathematics,
Vol. 376,
Issue. ,
p.
107444.
Balogh, József
Kostochka, Alexandr
Lavrov, Mikhail
and
Liu, Xujun
2022.
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree.
Combinatorics, Probability and Computing,
Vol. 31,
Issue. 1,
p.
109.
Balogh, József
Kostochka, Alexandr
Lavrov, Mikhail
and
Liu, Xujun
2022.
Monochromatic connected matchings in 2‐edge‐colored multipartite graphs.
Journal of Graph Theory,
Vol. 100,
Issue. 3,
p.
578.
Łuczak, Tomasz
and
Rahimi, Zahra
2022.
Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree.
Journal of Graph Theory,
Vol. 99,
Issue. 4,
p.
691.
You, Chunlin
and
Lin, Qizhong
2023.
Three-Color Ramsey Number of an Odd Cycle Versus Bipartite Graphs with Small Bandwidth.
Graphs and Combinatorics,
Vol. 39,
Issue. 3,
Galeana-Sánchez, Hortensia
Hernández-Lorenzana, Felipe
Sánchez-López, Rocío
and
Vilchis-Alfaro, Carlos
2024.
On the existence of cycles with restrictions in the color transitions in edge-colored complete graphs.
Boletín de la Sociedad Matemática Mexicana,
Vol. 30,
Issue. 2,
Łuczak, Tomasz
Polcyn, Joanna
and
Rahimi, Zahra
2024.
On the restricted size Ramsey number for a pair of cycles.
Discrete Mathematics,
Vol. 347,
Issue. 4,
p.
113891.