Cops and robber on subclasses of P5-free graphs. - Uttam K. Gupta; Suchismita Mishra 001; Dinabandhu Pradhan (CoRR, 2021)

Borodin-Kostochka's conjecture on $$(P_5,C_4)$$-free graphs. - Uttam K. Gupta; Dinabandhu Pradhan (J. Appl. Math. Comput., 2021)

Towards a conjecture on the recoloring diameter of planar graphs. - L. Sunil Chandran; Uttam K. Gupta; Dinabandhu Pradhan (CoRR, 2022)

Cops and robber on subclasses of P5-free graphs. - Uttam K. Gupta; Suchismita Mishra 001; Dinabandhu Pradhan (Discret. Math., 2023)

Strengthening Brooks' chromatic bound on P6-free graphs. - Uttam K. Gupta; Dinabandhu Pradhan (Discret. Appl. Math., 2024)

List recoloring of planar graphs. - L. Sunil Chandran; Uttam K. Gupta; Dinabandhu Pradhan (Discret. Appl. Math., 2025)

Secure domination in P5-free graphs. - Paras Maniya; Uttam K. Gupta; Michael A. Henning; Dinabandhu Pradhan (CoRR, 2025)