12 citations · 23 across the 13 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2022
Efficient attack sequences in m-eternal domination
Václav Blažej, Jan Matyáš Křišťan, Tomáš Valla
We study the m-eternal domination problem from the perspective of the attacker. For many graph classes, the minimum required number of guards to defend eternally is known. By defin…
cs.DM2019
On Induced Online Ramsey Number of Paths, Cycles, and Trees
Václav Blažej, Pavel Dvořák, Tomáš Valla
An online Ramsey game is a game between Builder and Painter, alternating in turns. They are given a graph and a graph of an infinite set of independent vertices. In each ro…
cs.DM2016
Automorphisms of the Cube
Pavel Dvořák, Tomáš Valla
Consider a hypergraph where the vertices are points of the -dimensional combinatorial cube and the edges are all sets of points such that they are in one line.…