The bottleneck independent domination on the classes of bipartite graphs and block graphs
Information Sciences—Informatics and Computer Science: An International Journal
On the computational complexity of upper total domination
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Note: The harmonious coloring problem is NP-complete for interval and permutation graphs
Discrete Applied Mathematics
Hardness results and approximation algorithm for total liar's domination in graphs
Journal of Combinatorial Optimization
Hi-index | 0.89 |