Author

S. Nanoti

h-index 3 View on Semantic Scholar

We have 2 of 18 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Structural and computational aspects of majority coloring games

The study of the computational complexity of the strong majority coloring game is initiated, and it is proved that the decision version of the Strong Majority Game Chromatic Number problem is PSPACE-complete and the Strong Majority 2-Coloring problem is NP-complete on Eulerian graphs.

Yash Chawda, S. Nanoti, Brahadeesh Sankarnarayanan et al. · 0 citations

Preprint Sep 2026

On the majority game chromatic number of forests and other graphs

A majority coloring of a graph $G$ is a vertex coloring of $G$ in which no vertex has more than half of its neighbors colored with its own color. The least number of colors required for a majority coloring of $G$ is the majority chromatic number $\mu(G)$. The majority coloring game, introduced by Bosek et al. (2019), i...

Yash Chawda, S. Nanoti, Brahadeesh Sankarnarayanan · 1 citation