Get started
Author

T. Karthick

Observed name: Karthick, T.
Observed institutions: Harvard University, Princeton University, Nankai University, Indian Institute of Technology Madras, Institute of Mathematical Sciences, Indian Statistical Institute, Mississippi State University
ORCID: 0000-0002-5950-9093
Observed ORCID: 0000-0002-5950-9093
OpenAlex ID: A5071177090
Perfect coloring and linearly χ‐bound P6‐free graphs
2006 · S. A. Choudum, T. Karthick, et al. · Journal of Graph Theory · 35
Coloring graphs with no induced five‐vertex path or gem
2020 · Maria Chudnovsky, T. Karthick, et al. · Journal of Graph Theory · 24
PDF
Square-Free Graphs with No Six-Vertex Induced Path
2019 · T. Karthick, Frédéric Maffray · SIAM Journal on Discrete Mathematics · 24
PDF
Polynomial Cases for the Vertex Coloring Problem
2018 · T. Karthick, Frédéric Maffray, et al. · Algorithmica · 24
PDF
Vizing Bound for the Chromatic Number on Some Graph Classes
2015 · T. Karthick, Frédéric Maffray · Graphs and Combinatorics · 24
Maximal cliques in {P2∪P3,C4} -free graphs
2010 · S.A. Choudum, T. Karthick · Discrete Mathematics · 23
Coloring (gem, co‐gem)‐free graphs
2018 · T. Karthick, Frédéric Maffray · Journal of Graph Theory · 21
On the Chromatic Number of ( $$P_6$$ P 6 , Diamond)-Free Graphs
2018 · T. Karthick, Suchismita Mishra · Graphs and Combinatorics · 19
Bounding χ in terms of ω and Δ for some classes of graphs
2011 · N.R. Aravind, T. Karthick, et al. · Discrete Mathematics · 18
PDF
On graphs with no induced five‐vertex path or paraglider
2021 · Shenwei Huang, T. Karthick · Journal of Graph Theory · 17
PDF
Linear Chromatic Bounds for a Subfamily of 3K 1-free Graphs
2008 · S. A. Choudum, T. Karthick, et al. · Graphs and Combinatorics · 17
Maximum weight independent sets in hole- and dart-free graphs
2012 · M. Basavaraju, L.S. Chandran, et al. · Discrete Applied Mathematics · 16
PDF
Chromatic bounds for some classes of 2K2 -free graphs
2018 · T. Karthick, Suchismita Mishra · Discrete Mathematics · 15
PDF
Maximum weight independent sets in classes related to claw-free graphs
2015 · T. Karthick, Frédéric Maffray · Discrete Applied Mathematics · 14
Star Coloring of Certain Graph Classes
2017 · T. Karthick · Graphs and Combinatorics · 12
Weighted independent sets in classes of P6 -free graphs
2015 · T. Karthick, Frédéric Maffray · Discrete Applied Mathematics · 12
On atomic structure of P5 -free subclasses and Maximum Weight Independent Set problem
2013 · T. Karthick · Theoretical Computer Science · 12
PDF
Weighted independent sets in a subclass of P6 -free graphs
2016 · T. Karthick · Discrete Mathematics · 11
PDF
Coloring Graph Classes with no Induced Fork via Perfect Divisibility
2022 · T. Karthick, Jenny Kaufmann, et al. · The Electronic Journal of Combinatorics · 10
PDF
Weighted efficient domination in two subclasses of P6 -free graphs
2015 · Andreas Brandstädt, T. Karthick · Discrete Applied Mathematics · 9
PDF
Coloring of (P5, 4-wheel)-free graphs
2022 · Arnab Char, T. Karthick · Discrete Mathematics · 8
First-Fit coloring of {P5,K4−e} -free graphs
2010 · S.A. Choudum, T. Karthick · Discrete Applied Mathematics · 8
PDF
χ -boundedness and related problems on graphs without long induced paths: A survey
2024 · Arnab Char, T. Karthick · Discrete Applied Mathematics · 7
Improved bounds on the chromatic number of (P5, flag)-free graphs
2023 · Arnab Char, T. Karthick · Discrete Mathematics · 7
Square-Free Graphs with no Induced Fork
2021 · Maria Chudnovsky, Shenwei Huang, et al. · The Electronic Journal of Combinatorics · 7
PDF
Works count: 55
Citation count: 453
H-index: 14
I10-index: 19
Year
Topic
Type