- Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs2021 | Faculty of Mathematics and Physics
- A step toward the Bermond-Thomassen conjecture about disjoint cycles in digraphs2009 | Faculty of Mathematics and Physics
- On a Conjecture of Thomassen Concerning Subgraphs of Large Girth2011 | Faculty of Mathematics and Physics
- Edge-decomposing graphs into coprime forests2021 | Faculty of Mathematics and Physics
- Decomposing graphs into paths and trees2017 | Faculty of Mathematics and Physics
- Edge-partitioning 3-edge-connected graphs into paths2022 | Faculty of Mathematics and Physics
- Sub-exponentially many 3-colorings of triangle-free planar graphs2013 | Faculty of Mathematics and Physics
- Do Triangle-Free Planar Graphs have Exponentially Many 3-Colorings?2017 | Faculty of Mathematics and Physics
- Triangle-free planar graphs with at most 64n(0.731 3)-colorings2022 | Faculty of Mathematics and Physics