T. Karthick
Scholar

T. Karthick

Google Scholar ID: sDZZrA8AAAAJ
Associate Professor, Indian Statistical Institute, Chennai Centre
Graph Theory and Graph Algorithms
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
387
 
H-index
13
 
i10-index
17
 
Publications
20
 
Co-authors
0
 
Contact
No contact links provided.
Publications
2 items
On near optimal colorable graphs
2025
Cited
0
Coloring of ($P_2+P_4$, $K_4-e$)-free graphs
2025
Cited
0
Resume (English only)
Academic Achievements
  • C.U.Angeliya, Arnab Char and T.Karthick, On near optimal colorable graphs. Discrete Applied Mathematics, accepted for publication.
  • Arnab Char and T.Karthick, On graphs with no induced P5 or K5– e. Journal of Graph Theory, 110:1 (2025) 5–22.
  • Arnab Char and T.Karthick, Optimal coloring of (P2 + P3, gem)-free graphs. Discrete Mathematics, 348:10 (2025) Article no:114554.
  • Arnab Char and T.Karthick, χ-boundedness and related problems on graphs without long induced paths: A survey. Discrete Applied Mathematics, 364 (2025) 99–119.
  • Arnab Char and T.Karthick, Optimal chromatic bound for (P2 + P3, P2 + P3)-free graphs. Journal of Graph Theory, 105:2 (2024) 149–178.
  • S.Huang, Y.Ju and T.Karthick, Coloring (P5, kite)-free graphs with small cliques. Discrete Applied Mathematics, 344 (2024) 129–139.
  • Arnab Char and T.Karthick, Improved bounds on the chromatic number of (P5, flag)-free graphs. Discrete Mathematics, 346 (2023) Article no:113501.
  • T.Karthick, J.Kaufmann and V.Sivaraman, Coloring graph classes with no induced fork via perfect divisibility. The Electronic Journal of Combinatorics, 29:3 (2022) #P3.19
  • Arnab Char and T.Karthick, Coloring of (P5, 4-wheel)-free graphs. Discrete Mathematics, 345:5 (2022) Article no:112795.
  • S.Huang and T.Karthick, On graphs with no induced five-vertex path or paraglider. Journal of Graph Theory, 97:2 (2021) 305–323.
  • M.Chudnovsky, S.Huang, T.Karthick and J.Kaufmann, Square-free graphs with no induced fork. The Electronic Journal of Combinatorics, 28:2 (2021) #P2.20.
  • S.A.Choudum, T.Karthick and Manoj M.Belavadi, Structural domination and coloring of some (P7, C7)-free graphs. Discrete Mathematics, 344:3 (2021) Article no:112244.
  • M.Chudnovsky, T.Karthick, P.Maceli and F.Maffray, Coloring graphs with no induced five-vertex path or gem. Journal of Graph Theory, 95:4 (2020) 527–542.
  • T.Karthick and F.Maffray, Square-free graphs with no six-vertex induced path. (In: 10th ICGT 2018, France.) SIAM Journal on Discrete Mathematics, 33:2 (2019) 874–909.
  • T.Karthick, F.Maffray and L.Pastor, Polynomial cases for the vertex coloring problem. Algorithmica, 81 (2019) 1053–1074.
  • T.Karthick and F.Maffray, Coloring (gem, co-gem)-free graphs. Journal of Graph Theory, 89 (2018) 288–303.
  • T.Karthick and S.Mishra, Chromatic bounds for some classes of 2K2-free graphs. Discrete Mathematics, 341 (2018) 3079–3088.
  • T.Karthick and S.Mishra, On the chromatic number of (P6, diamond)-free graphs. Graphs and Combinatorics, 34 (2018) 677–692.
  • T.Karthick, Star Coloring of certain graph classes. Graphs and Combinatorics, 34 (2018) 109–128.
  • A.Brandstädt, E.M.Eschen, E.Friese and T.Karthick, Efficient domination for classes of P6-free graphs. Discrete Applied Mathematics, 223 (2017) 15–27.
  • T.Karthick and F.Maffray, Maximum weight independent sets in classes related to claw-free graphs. Discrete Applied Mathematics, 216 (2017) 232–239.
  • T.Karthick, Independent sets in some classes of Si,j,k-free graphs. Journal of Combinatorial Optimization, 34 (2017) 612–630.
  • T.Karthick, Structure of squares and efficient domination in graph classes. Theoretical Computer Science, 652 (2016) 38–46.
  • T.Karthick, Weighted independent sets in a subclass of P6-free graphs. Discrete Mathematics, 339 (2016) 1412–1418.
  • T.Karthick and F.Maffray, Weighted independent sets in classes of P6-free graphs. (In: 9th ICGT 2014, France.) Discrete Applied Mathematics, 209 (2016) 217–226.
  • A.Brandstädt and T.Karthick, Weighted efficient domination in two subclasses of P6-free graphs.
Research Experience
  • Associate Professor, Computer Science Unit, Indian Statistical Institute, Chennai Centre.
Education
  • Information not provided
Background
  • Research Interests: Graph Theory, Graph Algorithms, and Combinatorics. Specialization in graph classes, graph colorings and variations, structure and algorithmic aspects in graphs.
Miscellany
  • Information not provided
Co-authors
0 total
Co-authors: 0 (list not available)