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 | 
Carbonero A, Koerts H, Moore B, Spirkl S. On heroes in digraphs with forbidden induced forests. European Journal of Combinatorics. 2025;125. doi:10.1016/j.ejc.2024.104104
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19018 |
Burova S, Lichev L. The semi-random tree process. European Journal of Combinatorics. 2025;126. doi:10.1016/j.ejc.2025.104120
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19879 |
Dvořák Z, Moore B, Seifrtová M, Šámal R. Precoloring extension in planar near-Eulerian-triangulations. European Journal of Combinatorics. 2025;127. doi:10.1016/j.ejc.2025.104138
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20320 |
| 
|
Mies S, Moore B, Smith-Roberge E. Beyond the pseudoforest strong Nine Dragon Tree theorem. European Journal of Combinatorics. 2025;130(12). doi:10.1016/j.ejc.2025.104214
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 9589 |
Greenhill C, Isaev M, Kwan MA, McKay BD. The average number of spanning trees in sparse graphs with given degrees. European Journal of Combinatorics. 2017;63:6-25. doi:10.1016/j.ejc.2017.02.003
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv