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.
7 Publications
2025 | Published | Journal Article | IST-REx-ID: 18753 | 
Carbonero, Alvaro, et al. “On Heroes in Digraphs with Forbidden Induced Forests.” European Journal of Combinatorics, vol. 125, 104104, Elsevier, 2025, doi:10.1016/j.ejc.2024.104104.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Journal Article | IST-REx-ID: 19018 |
Burova, Sofiya, and Lyuben Lichev. “The Semi-Random Tree Process.” European Journal of Combinatorics, vol. 126, 104120, Elsevier, 2025, 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, Zdeněk, et al. “Precoloring Extension in Planar Near-Eulerian-Triangulations.” European Journal of Combinatorics, vol. 127, 104138, Elsevier, 2025, 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, Sebastian, et al. “Beyond the Pseudoforest Strong Nine Dragon Tree Theorem.” European Journal of Combinatorics, vol. 130, no. 12, 104214, Elsevier, 2025, doi:10.1016/j.ejc.2025.104214.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20490 |
Edelsbrunner, Herbert, et al. “Flips in Two-Dimensional Hypertriangulations.” European Journal of Combinatorics, vol. 132, 104248, Elsevier, 2025, doi:10.1016/j.ejc.2025.104248.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20482 |
|
|
Boyadzhiyska, Simona, et al. “Odd-Ramsey Numbers of Complete Bipartite Graphs.” European Journal of Combinatorics, vol. 131, 104235, Elsevier, 2025, doi:10.1016/j.ejc.2025.104235.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 9589 |
Greenhill, Catherine, et al. “The Average Number of Spanning Trees in Sparse Graphs with given Degrees.” European Journal of Combinatorics, vol. 63, Elsevier, 2017, pp. 6–25, doi:10.1016/j.ejc.2017.02.003.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv