5 papers
Two Results on Outer-String Graphs
Todor Antić, Vít Jelínek, Jan Kratochvíl +1
An \emph{outer-string representation} of a graph is an intersection representation of where vertices are represented by curves (strings) inside the unit disk and each curve…
Monadic Second-Order Logic of Permutations
Vít Jelínek, Michal Opler
Permutations can be viewed as pairs of linear orders, or more formally as models over a signature consisting of two binary relation symbols. This approach was adopted by Albert, Bo…
Structure of betweenness uniform graphs with low values of betweenness centrality
Babak Ghanbari, David Hartman, Vít Jelínek +3
This work deals with undirected graphs that have the same betweenness centrality for each vertex, so-called betweenness uniform graphs (or BUGs). The class of these graphs is not t…
The Hierarchy of Hereditary Sorting Operators
Vít Jelínek, Michal Opler, Jakub Pekárek
We consider the following general model of a sorting procedure: we fix a hereditary permutation class , which corresponds to the operations that the procedure is allow…
String graphs with precise number of intersections
Petr Chmel, Vít Jelínek
A string graph is an intersection graph of curves in the plane. A -string graph is a graph with a string representation in which every pair of curves intersects in at most p…