Arnab Char

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2025

On near optimal colorable graphs

C. U. Angeliya, Arnab Char, T. Karthick

A class of graphs $G$ is said to be \emph{near optimal colorable} if there exists a constant $c \in N$ such that every graph $G \in G$ satisfies $Ï(G) \leq \max\{…

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…

On near optimal colorable graphs

4K1​-free graph with the cop number 3

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