Divisibility conditions in almost Moore digraphs with selfrepeats. - Jakub Teska; Roman Kuzel; Mirka Miller (Electron. Notes Discret. Math., 2006)

On 2-walks in chordal planar graphs. - Jakub Teska (Discret. Math., 2009)

Toughness threshold for the existence of 2-walks in K4-minor-free graphs. - Zdenek Dvorák 001; Daniel Král'; Jakub Teska (Discret. Math., 2010)

On 2-Connected Spanning Subgraphs with Bounded Degree in K1, r-Free Graphs. - Roman Kuzel; Jakub Teska (Graphs Comb., 2011)

Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs. - Roman Kuzel; Zdenek Ryjácek; Jakub Teska; Petr Vrána (Discret. Math., 2012)

Stability of Hereditary Graph Classes Under Closure Operations. - Mirka Miller; Joe Ryan 001; Zdenek Ryjácek; Jakub Teska; Petr Vrána (J. Graph Theory, 2013)

FO Model Checking of Interval Graphs - Robert Ganian; Petr Hlinený; Daniel Král; Jan Obdrzálek; Jarett Schwartz; Jakub Teska (Log. Methods Comput. Sci., 2015)

Bounding the distance among longest paths in a connected graph. - Jan Ekstein; Shinya Fujita 001; Adam Kabela; Jakub Teska (Discret. Math., 2018)

Trestles in the squares of graphs. - Adam Kabela; Jakub Teska (Discret. Math., 2021)

Hamiltonian properties in generalized lexicographic products. - Jan Ekstein; Jakub Teska (Discuss. Math. Graph Theory, 2025)