Arnab Char

13 papers Journal 13
YearRankTypeTitle / Venue / Authors
2026 J jnl
On near optimal colorable graphs.
Discret. Appl. Math.
C. U. Angeliya, Arnab Char, T. Karthick
2025 J jnl
4K
CoRR
Arnab Char, Paras Maniya, Dinabandhu Pradhan
2025 J jnl
On Graphs With No Induced P5 or K5-e.
J. Graph Theory
Arnab Char, Thiyagarajan Karthick
2025 J jnl
On near optimal colorable graphs.
CoRR
C. U. Angeliya, Arnab Char, T. Karthick
2025 J jnl
Optimal coloring of (P2 + P3, gem)-free graphs.
Discret. Math.
Arnab Char, T. Karthick
2025 J jnl
χ-boundedness and related problems on graphs without long induced paths: A survey.
Discret. Appl. Math.
Arnab Char, T. Karthick
2024 J jnl
An optimal chromatic bound for (P
CoRR
Arnab Char, Thiyagarajan Karthick
2024 J jnl
Optimal chromatic bound for ( ¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$ )-free graphs.
J. Graph Theory
Arnab Char, Thiyagarajan Karthick
2023 J jnl
Improved bounds on the chromatic number of (
Discret. Math.
Arnab Char, T. Karthick
2023 J jnl
On graphs with no induced P
CoRR
Arnab Char, T. Karthick
2022 J jnl
Coloring of (
Discret. Math.
Arnab Char, T. Karthick
2022 J jnl
Optimal chromatic bound for (P
CoRR
Arnab Char, T. Karthick
2020 J jnl
Wheel-free graphs with no induced five-vertex path.
CoRR
Arnab Char, T. Karthick