Skip to content

Author

Eshwar Srinivasan

1 paper indexed here

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

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.