15 citations · 17 across the 24 of their papers we have counts for
3 papers · 1 filter
Location-Domination Type Problems Under the Mycielski Construction
Silvia M. Bianchi, Dipayan Chakraborty, Yanina Lucarini +1
We consider the following variants of the classical minimum dominating set problem in graphs: locating-dominating set, locating total-dominating set and open locating-dominating se…
Contracting edges to destroy a pattern: A complexity study
Dipayan Chakraborty, R. B. Sandeep
Given a graph G and an integer k, the objective of the -Contraction problem is to check whether there exists at most k edges in G such that contracting them in G results in a gr…
On locating and neighbor-locating colorings of sparse graphs
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi +2
A proper -coloring of a graph is a \emph{neighbor-locating -coloring} if for each pair of vertices in the same color class, the two sets of colors found in their respecti…