Wheel-free graphs with no induced five-vertex path. - Arnab Char; T. Karthick (CoRR, 2020)

Optimal chromatic bound for (P2+P3, P2∓P3)-free graphs. - Arnab Char; T. Karthick (CoRR, 2022)

Coloring of (P5, 4-wheel)-free graphs. - Arnab Char; T. Karthick (Discret. Math., 2022)

On graphs with no induced P5 or K5-e. - Arnab Char; T. Karthick (CoRR, 2023)

Improved bounds on the chromatic number of (P5, flag)-free graphs. - Arnab Char; T. Karthick (Discret. Math., 2023)

An optimal chromatic bound for (P2+P3, gem)-free graphs. - Arnab Char; Thiyagarajan Karthick (CoRR, 2024)

Optimal chromatic bound for ( ¯ ${P}_{2}+{P}_{3}, bar{{P}_{2}+{P}_{3}}$ )-free graphs. - Arnab Char; Thiyagarajan Karthick (J. Graph Theory, 2024)

χ-boundedness and related problems on graphs without long induced paths: A survey. - Arnab Char; T. Karthick (Discret. Appl. Math., 2025)

Optimal coloring of (P2 + P3, gem)-free graphs. - Arnab Char; T. Karthick (Discret. Math., 2025)

On near optimal colorable graphs. - C. U. Angeliya; Arnab Char; T. Karthick (CoRR, 2025)

4K1-free graph with the cop number 3. - Arnab Char; Paras Maniya; Dinabandhu Pradhan (CoRR, 2025)