Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Pillai, Raji. R."'
A class of graphs $\mathcal{G}$ is $\chi$-bounded if there exists a function $f$ such that $\chi(G) \leq f(\omega(G))$ for each graph $G \in \mathcal{G}$, where $\chi(G)$ and $\omega(G)$ are the chromatic and clique number of $G$, respectively. The s
Externí odkaz:
http://arxiv.org/abs/2312.08759
In this paper, we study the computational complexity of \textsc{$s$-Club Cluster Vertex Deletion}. Given a graph, \textsc{$s$-Club Cluster Vertex Deletion ($s$-CVD)} aims to delete the minimum number of vertices from the graph so that each connected
Externí odkaz:
http://arxiv.org/abs/2210.07699
Publikováno v:
In Discrete Applied Mathematics 15 March 2024 345:170-189
Autor:
Chandran, L. Sunil a, Das, Sajal K. b, Hell, Pavol c, Padinhatteeri, Sajith d, Pillai, Raji R. a, ⁎
Publikováno v:
In Discrete Applied Mathematics 31 March 2023 328:97-107
Autor:
Pillai, Raji R., Idicula, Sumam Mary
Publikováno v:
Proceedings of the 1st Amrita ACM-W Celebration: Women in Computing in India; 9/16/2010, p1-4, 4p