Arpan Sadhukhan

activity

20192026

most citedAn Alternative Proof of Steinhaus Theorem

2 citations · 3 across the 10 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

Sharp quadratic $χ$ -binding functions for powers of bipartite graphs

Arpan Sadhukhan, Suraj Kumar Sahoo

For every natural number $r \geq 2$ , we construct $r^{t h}$ powers of bipartite graphs whose chromatic number is quadratic in their clique number, showing that the straightforward qu…

math.CO2026

Exact-Distance Domination in Grid Graphs

Sandip Das, Sweta Das, Arpan Sadhukhan

Let $G_{n}$ be the $n \times n$ square grid, and let $k \geq 2$ . A set $D \subseteq V (G_{n})$ is an \emph{exact-distance $k$ -dominating set} if every vertex $v \in V (G_{n}) ∖ D$ has a…

math.CO2026

Locating a Seymour vertex in oriented graphs having minimum outdegree at most 7

Arpan Sadhukhan, R. B. Sandeep, Sagnik Sen

A vertex $v$ of an oriented graph $D$ is a Seymour vertex if the number of outneighbors of $v$ is less than or equal to the number of second outneighbors of $v$ (vertices at direct…

Sharp quadratic χ-binding functions for powers of bipartite graphs

Exact-Distance Domination in Grid Graphs

Locating a Seymour vertex in oriented graphs having minimum outdegree at most 7

Sharp quadratic $χ$ -binding functions for powers of bipartite graphs