4 citations · 7 across the 11 of their papers we have counts for
12 papers
On the Classical and Parameterized Complexity of Strong Odd Coloring
Dinabandhu Pradhan, Vaishali Sharma, Shaily Verma
A strong odd -coloring of a graph is a proper -coloring such that every color appearing in the neighborhood of a non-isolated vertex appears an odd number of times. The m…
Complexity and algorithms for proper conflict-free coloring in graphs
Dinabandhu Pradhan, Vaishali Sharma
A proper conflict-free (PCF) -coloring of a graph is a proper -coloring such that there exists a color that appears exactly once in the neighborhood of every non-isolated…
Coloring -free graphs with colors
Uttam K. Gupta, Dinabandhu Pradhan, Rashmi Rekha Swain
For a graph , let , , and denote the maximum degree, clique number, and chromatic number of , respectively. Let and denote the chordless path a…
Locating-dominating partitions for some classes of graphs
Florent Foucaud, Paras Vinubhai Maniya, Kaustav Paul +1
A dominating set of a graph is a set such that every vertex in is adjacent to at least one vertex in . A set is a loc…
-free graph with the cop number
Arnab Char, Paras Vinubhai Maniya, Dinabandhu Pradhan
The game of cops and robber is a two-player turn-based game played on a graph where the cops try to capture the robber. The cop number of a graph , denoted by is the mini…
Disjunctive domination in maximal outerplanar graphs
Michael A. Henning, Paras Vinubhai Maniya, Dinabandhu Pradhan
A disjunctive dominating set of a graph is a set such that every vertex in has a neighbor in or has at least two vertices in at dis…