Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
5 Publications
2025 | Published | Journal Article | IST-REx-ID: 18753 | 
A. Carbonero, H. Koerts, B. Moore, and S. Spirkl, “On heroes in digraphs with forbidden induced forests,” European Journal of Combinatorics, vol. 125. Elsevier, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19018 |
S. Burova and L. Lichev, “The semi-random tree process,” European Journal of Combinatorics, vol. 126. Elsevier, 2025.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19879 |
Z. Dvořák, B. Moore, M. Seifrtová, and R. Šámal, “Precoloring extension in planar near-Eulerian-triangulations,” European Journal of Combinatorics, vol. 127. Elsevier, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20320 |
| 
|
S. Mies, B. Moore, and E. Smith-Roberge, “Beyond the pseudoforest strong Nine Dragon Tree theorem,” European Journal of Combinatorics, vol. 130, no. 12. Elsevier, 2025.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 9589 |
C. Greenhill, M. Isaev, M. A. Kwan, and B. D. McKay, “The average number of spanning trees in sparse graphs with given degrees,” European Journal of Combinatorics, vol. 63. Elsevier, pp. 6–25, 2017.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv