5 papers
Off-diagonal Rado numbers for and
Rajat Adak, Yash Bakshi, L. Sunil Chandran +1
The study of Ramsey-type problems for linear equations originated with Schur's theorem and was later placed in a systematic framework by Richard Rado. In the off-diagonal setting,…
Off-diagonal Rado number for and
Rajat Adak, Yash Bakshi, L. Sunil Chandran +1
Ramsey-type problems for linear equations began with Schur's theorem and were systematically generalized by Richard Rado. In the off-diagonal framework for two colors, one consider…
m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs
Tiziana Calamoneri, Federico Corò, Neeldhara Misra +2
We study the m-Eternal Domination problem, which is the following two-player game between a defender and an attacker on a graph: initially, the defender positions k guards on verti…
On a Characterization of Spartan Graphs
Neeldhara Misra, Saraswati Girish Nanoti
The eternal vertex cover game is played between an attacker and a defender on an undirected graph . The defender identifies vertices to position guards on to begin with. The…
Revisiting Token Sliding on Chordal Graphs
Rajat Adak, Saraswati Girish Nanoti, Prafullkumar Tale
In this article, we revisit the complexity of the reconfiguration of independent sets under the token sliding rule on chordal graphs. In the \textsc{Token Sliding-Connectivity} pro…