1 citations · 2 across the 4 of their papers we have counts for
4 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…
Grounded String Representations of Series-Parallel Graphs without Transitive Edges
Sabine Cornelsen, Jan Kratochvíl, Miriam Münch +3
In a {\em grounded string representation} of a graph there is a horizontal line and each vertex is represented as a simple curve below with one end point on su…
Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
Nikola Jedličková, Jan Kratochvíl
A Hamiltonian path (a Hamiltonian cycle) in a graph is a path (a cycle, respectively) that traverses all of its vertices. The problems of deciding their existence in an input graph…
The Parametrized Complexity of the Segment Number
Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli +3
Given a straight-line drawing of a graph, a segment is a maximal set of edges that form a line segment. Given a planar graph , the segment number of is the minimum number of…