16 citations · 16 across the 4 of their papers we have counts for
5 papers
The number of abundant elements in union-closed families without small sets
Adam Kabela, Michal Polák, Jakub Teska
We let be a finite family of sets closed under taking unions and , and call an element abundant if it belongs to more than half of the…
Hamiltonian properties in generalized lexicographic products
Jan Ekstein, Jakub Teska
The lexicographic product of two graphs and is obtained from by replacing each vertex with a copy of and adding all edges between any pair of copies correspo…
Trestles in the squares of graphs
Adam Kabela, Jakub Teska
We show that the square of every connected -free graph satisfying a matching condition has a -connected spanning subgraph of maximum degree at most~. Furthermore,…
Bounding the distance among longest paths in a connected graph
Jan Ekstein, Shinya Fujita, Adam Kabela +1
It is easy to see that in a connected graph any 2 longest paths have a vertex in common. For k>=7, Skupien in [7] obtained a connected graph in which some k longest paths have no c…
FO Model Checking of Interval Graphs
Robert Ganian, Petr Hlineny, Daniel Kral +3
We study the computational complexity of the FO model checking problem on interval graphs, i.e., intersection graphs of intervals on the real line. The main positive result is that…