30 citations · 208 across the 26 of their papers we have counts for
4 papers · 1 filter
Irreversible 2-conversion set in graphs of bounded degree
Jan Kynčl, Bernard Lidický, Tomáš Vyskočil
An irreversible -threshold process (also a -neighbor bootstrap percolation) is a dynamic process on a graph where vertices change color from white to black if they have at le…
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…