22 citations · 43 across the 9 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2026
General Constructions of Permutation-Fair Dice
Tomáš Gavenčiak, Bernhard Haeupler, Václav Rozhoň
Suppose that each of players rolls a different die and the players are ordered by their rolls. Can the dice use disjoint labels such that ties are impossible, while all or…
math.CO2016★ 11 cited
Cops and Robbers on Intersection Graphs
Tomáš Gavenčiak, Przemysław Gordinowicz, Vít Jelínek +2
The cop number of a graph is the smallest such that cops win the game of cops and robber on . We investigate the maximum cop number of geometric intersection graphs,…
math.CO2013
Firefighting on square, hexagonal, and triangular grids
Tomas Gavenciak, Jan Kratochvil, Pawel Pralat
In this paper, we consider the \emph{firefighter problem} on a graph that is either finite or infinite. Suppose that a fire breaks out at a given vertex . In eac…