Jakub Teska

activity

20132022

most citedFO Model Checking of Interval Graphs

16 citations · 16 across the 4 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

math.CO2020

Hamiltonian properties in generalized lexicographic products

Jan Ekstein, Jakub Teska

The lexicographic product $G [H]$ of two graphs $G$ and $H$ is obtained from $G$ by replacing each vertex with a copy of $H$ and adding all edges between any pair of copies correspo…

math.CO2020

Trestles in the squares of graphs

Adam Kabela, Jakub Teska

We show that the square of every connected $S (K_{1, 4})$ -free graph satisfying a matching condition has a $2$ -connected spanning subgraph of maximum degree at most~ $3$ . Furthermore,…