17 citations · 26 across the 3 of their papers we have counts for
5 papers
On three measures of non-convexity
Josef Cibulka, Miroslav Korbelář, Jan Kynčl +3
The invisibility graph of a set is a (possibly infinite) graph whose vertices are the points of and two vertices are connected by an edge if a…
Graph sharing games: complexity and connectivity
Josef Cibulka, Jan Kynčl, Viola Mészáros +2
We study the following combinatorial game played by two players, Alice and Bob, which generalizes the Pizza game considered by Brown, Winkler and others. Given a connected graph G…
Universal Sets for Straight-Line Embeddings of Bicolored Graphs
Josef Cibulka, Jan Kyncl, Viola Mészáros +2
A set S of n points is 2-color universal for a graph G on n vertices if for every proper 2-coloring of G and for every 2-coloring of S with the same sizes of color classes as G has…
Solution of Peter Winkler's Pizza Problem
Josef Cibulka, Jan Kynčl, Viola Mészáros +2
Bob cuts a pizza into slices of not necessarily equal size and shares it with Alice by alternately taking turns. One slice is taken in each turn. The first turn is Alice's. She may…
Monochromatic triangles in two-colored plane
Vit Jelinek, Jan Kyncl, Rudolf Stolar +1
We prove that for any partition of the plane into a closed set and an open set and for any configuration of three points, there is a translated and rotated copy of …