3 papers
cs.CG2019
On the edge-length ratio of 2-trees
Václav Blažej, Jiří Fiala, Giuseppe Liotta
We study planar straight-line drawings of graphs that minimize the ratio between the length of the longest and the shortest edge. We answer a question of Lazard et al. [Theor. Comp…
cs.DS2019
On the m-eternal Domination Number of Cactus Graphs
Václav Blažej, Jan Matyáš Křišťan, Tomáš Valla
Given a graph , guards are placed on vertices of . Then vertices are subject to an infinite sequence of attacks so that each attack must be defended by a guard moving from a…
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…