Jakub Teska

According to our database, Jakub Teska authored at least 9 papers between 2006 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Trestles in the squares of graphs.

Adam Kabela, Jakub Teska

Discret. Math., 2021

2018

Bounding the distance among longest paths in a connected graph.

Jan Ekstein, Shinya Fujita, Adam Kabela, Jakub Teska

Discret. Math., 2018

2015

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

2013

Stability of Hereditary Graph Classes Under Closure Operations.

Mirka Miller, Joe Ryan, Zdenek Ryjácek, Jakub Teska, Petr Vrána

J. Graph Theory, 2013

2012

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

2011

On 2-Connected Spanning Subgraphs with Bounded Degree in <i>K</i>_{1, <i>r</i>}-Free Graphs.

Roman Kuzel, Jakub Teska

Graphs Comb., 2011

2010

Toughness threshold for the existence of 2-walks in K₄-minor-free graphs.

Zdenek Dvorák, Daniel Král', Jakub Teska

Discret. Math., 2010

2009

On 2-walks in chordal planar graphs.

Jakub Teska

Discret. Math., 2009

2006

Divisibility conditions in almost Moore digraphs with selfrepeats.

Jakub Teska, Roman Kuzel, Mirka Miller

Electron. Notes Discret. Math., 2006