Odd-Ramsey numbers of complete bipartite graphs
S. Boyadzhiyska, S. Das, T. Lesgourgues, K.H. Petrova, European Journal of Combinatorics 131 (2026).

On heroes in digraphs with forbidden induced forests
A. Carbonero, H. Koerts, B. Moore, S. Spirkl, European Journal of Combinatorics 125 (2025).

The semi-random tree process
S. Burova, L. Lichev, European Journal of Combinatorics 126 (2025).

Precoloring extension in planar near-Eulerian-triangulations
Z. Dvoák, B. Moore, M. Seifrtová, R. Sámal, European Journal of Combinatorics 127 (2025).

Flips in two-dimensional hypertriangulations
H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss, M. Saghafian, European Journal of Combinatorics 132 (2025).

Beyond the pseudoforest strong Nine Dragon Tree theorem
S. Mies, B. Moore, E. Smith-Roberge, European Journal of Combinatorics 130 (2025).

The average number of spanning trees in sparse graphs with given degrees
C. Greenhill, M. Isaev, M.A. Kwan, B.D. McKay, European Journal of Combinatorics 63 (2017) 6–25.