Arnab Char

According to our database, Arnab Char authored at least 7 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Optimal chromatic bound for ( ¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$ )-free graphs.

Arnab Char, Thiyagarajan Karthick

J. Graph Theory, February, 2024

An optimal chromatic bound for (P₂+P₃, gem)-free graphs.

Arnab Char, Thiyagarajan Karthick

CoRR, 2024

2023

Improved bounds on the chromatic number of (<i>P</i>₅, flag)-free graphs.

Arnab Char, T. Karthick

Discret. Math., September, 2023

On graphs with no induced P₅ or K₅-e.

Arnab Char, T. Karthick

CoRR, 2023

2022

Coloring of (<i>P</i>₅, 4-wheel)-free graphs.

Arnab Char, T. Karthick

Discret. Math., 2022

Optimal chromatic bound for (P₂+P₃, P₂∓P₃)-free graphs.

Arnab Char, T. Karthick

CoRR, 2022

2020

Wheel-free graphs with no induced five-vertex path.

Arnab Char, T. Karthick

CoRR, 2020