D. Pradhan

works on

clique number 1 graph coloring 1 maximum degree 1 P6 C4)-free graphs 1 Δ-1 coloring 1

From the 1 of 6 linked papers with an AI index.

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2026

Complexity and algorithms for proper conflict-free coloring in graphs

Dinabandhu Pradhan, Vaishali Sharma

A proper conflict-free (PCF) $k$ -coloring of a graph $G$ is a proper $k$ -coloring such that there exists a color that appears exactly once in the neighborhood of every non-isolated…

cs.DM2025

$4 K_{1}$ -free graph with the cop number $3$

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 $G$ , denoted by $c (G)$ is the mini…

Complexity and algorithms for proper conflict-free coloring in graphs

4K1​-free graph with the cop number 3

$4 K_{1}$ -free graph with the cop number $3$