U. K. Gupta

activity

20212026

most citedList recoloring of planar graphs

1 citations · 2 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2026

Coloring $(P_{6}, C_{4})$ -free graphs with $Δ - 1$ colors

Uttam K. Gupta, Dinabandhu Pradhan, Rashmi Rekha Swain

For a graph $G$ , let $Δ (G)$ , $ω (G)$ , and $χ (G)$ denote the maximum degree, clique number, and chromatic number of $G$ , respectively. Let $P_{n}$ and $C_{n}$ denote the chordless path a…

math.CO2025★ 1 cited

Secure domination in $P_{5}$ -free graphs

Uttam K. Gupta, Michael A. Henning, Paras Vinubhai Maniya +1

A dominating set of a graph $G$ is a set $S \subseteq V (G)$ such that every vertex in $V (G) ∖ S$ has a neighbor in $S$ , where two vertices are neighbors if they are adjacen…

math.CO2022★ 1 cited

List recoloring of planar graphs

L. Sunil Chandran, Uttam K. Gupta, Dinabandhu Pradhan

A list assignment $L$ of a graph $G$ is a function that assigns to every vertex $v$ of $G$ a set $L (v)$ of colors. A proper coloring $α$ of $G$ is called an $L$ -coloring of $G$ if…

math.CO2021

Cops and robber on subclasses of $P_{5}$ -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…

Coloring (P6​,C4​)-free graphs with Δ−1 colors

Secure domination in P5​-free graphs

List recoloring of planar graphs

Cops and robber on subclasses of P5​-free graphs

Coloring $(P_{6}, C_{4})$ -free graphs with $Δ - 1$ colors

Secure domination in $P_{5}$ -free graphs

Cops and robber on subclasses of $P_{5}$ -free graphs