42 citations · 75 across the 11 of their papers we have counts for
14 papers
Ramsey Achievement Games on Graphs : Algorithms and Bounds
Xiumin Wang, Zhong Huang, Xiangqian Zhou +2
In 1982, Harary introduced the concept of Ramsey achievement game on graphs. Given a graph with no isolated vertices. Consider the following game played on the complete graph $…
Perturbation results for distance-edge-monitoring numbers
Chenxu Yang, Ralf Klasing, Changxiang He +1
Foucaud et al. recently introduced and initiated the study of a new graph-theoretic concept in the area of network monitoring. Given a graph , a set $M \subseteq V(…
The RED-BLUE SEPARATION problem on graphs
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud +2
We introduce the Red-Blue Separation problem on graphs, where we are given a graph whose vertices are colored either red or blue, and we want to select a (small) subset $…
On the distance-edge-monitoring numbers of graphs
Chengxu Yang, Ralf Klasing, Yaping Mao +1
Foucaud et al. [Discrete Appl. Math. 319 (2022), 424-438] recently introduced and initiated the study of a new graph-theoretic concept in the area of network monitoring. For a set…
Monitoring the edges of product networks using distances
Wen Li, Ralf Klasing, Yaping Mao +1
Foucaud {\it et al.} recently introduced and initiated the study of a new graph-theoretic concept in the area of network monitoring. Let be a graph with vertex set , …
Perpetual maintenance of machines with different urgency requirements
Leszek Gąsieniec, Tomasz Jurdziński, Ralf Klasing +4
A garden is populated by bamboos with the respective daily growth rates . It is assumed that the initial heights of…