5 papers · 1 filter
On Eternal Connected Vertex Cover
Rajat Adak, Saraswati Girish Nanoti
For a connected graph with at least one edge, the \textit{eternal connected vertex cover} number is the minimum number of guards that can maintain a connected vertex…
Structural and computational aspects of majority coloring games
Yash Chawda, Saraswati Girish Nanoti, Brahadeesh Sankarnarayanan +1
A majority coloring of a graph is a coloring of such that, for each vertex , the number of neighbors of with the same color as is at most .…
On the majority game chromatic number of forests and other graphs
Yash Chawda, Saraswati Girish Nanoti, Brahadeesh Sankarnarayanan
A majority coloring of a graph is a vertex coloring of in which no vertex has more than half of its neighbors colored with its own color. The least number of colors require…
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…