4 citations · 7 across the 11 of their papers we have counts for
6 papers · 1 filter
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…
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…
Secure domination in -free graphs
Uttam K. Gupta, Michael A. Henning, Paras Vinubhai Maniya +1
A dominating set of a graph is a set such that every vertex in has a neighbor in , where two vertices are neighbors if they are adjacen…
List recoloring of planar graphs
L. Sunil Chandran, Uttam K. Gupta, Dinabandhu Pradhan
A list assignment of a graph is a function that assigns to every vertex of a set of colors. A proper coloring of is called an -coloring of if…
Cops and robber on subclasses of -free graphs
Uttam K. Gupta, Suchismita Mishra, Dinabandhu Pradhan
The game of cops and robber is a turn based vertex pursuit game played on a connected graph between a team of cops and a single robber. The cops and the robber move alternately alo…