T. Karthick

438 total citations
32 papers, 237 citations indexed

About

T. Karthick is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, T. Karthick has authored 32 papers receiving a total of 237 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Computational Theory and Mathematics, 21 papers in Discrete Mathematics and Combinatorics and 6 papers in Geometry and Topology. Recurrent topics in T. Karthick's work include Advanced Graph Theory Research (32 papers), Graph Labeling and Dimension Problems (23 papers) and Limits and Structures in Graph Theory (21 papers). T. Karthick is often cited by papers focused on Advanced Graph Theory Research (32 papers), Graph Labeling and Dimension Problems (23 papers) and Limits and Structures in Graph Theory (21 papers). T. Karthick collaborates with scholars based in India, France and United States. T. Karthick's co-authors include Frédéric Maffray, S.A. Choudum, C. R. Subramanian, Shenwei Huang, Maria Chudnovsky, Andreas Brandstädt, L. Sunil Chandran and Manu Basavaraju and has published in prestigious journals such as Theoretical Computer Science, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

T. Karthick

32 papers receiving 234 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
T. Karthick India	10	228	136	45	20	13	32	237
Sophie Spirkl United States	7	141 0.6×	99 0.7×	47 1.0×	30 1.5×	8 0.6×	52	164
Nicolas Trotignon France	10	202 0.9×	107 0.8×	23 0.5×	24 1.2×	32 2.5×	38	205
Wensong Lin China	8	235 1.0×	86 0.6×	33 0.7×	114 5.7×	13 1.0×	57	247
Konrad K. Dabrowski United Kingdom	7	159 0.7×	88 0.6×	34 0.8×	18 0.9×	30 2.3×	29	168
Alexey Pokrovskiy United Kingdom	7	100 0.4×	90 0.7×	47 1.0×	45 2.3×	15 1.2×	23	130
Luke Postle Canada	6	110 0.5×	80 0.6×	24 0.5×	15 0.8×	14 1.1×	35	116
Marthe Bonamy France	9	175 0.8×	86 0.6×	33 0.7×	28 1.4×	29 2.2×	34	188
Deepak Rajendraprasad India	6	166 0.7×	78 0.6×	34 0.8×	22 1.1×	39 3.0×	24	172
Mostafa Blidia Algeria	9	202 0.9×	48 0.4×	33 0.7×	14 0.7×	51 3.9×	35	211
Máté Vizer Hungary	8	144 0.6×	108 0.8×	78 1.7×	17 0.8×	10 0.8×	34	183

Countries citing papers authored by T. Karthick

Since Specialization

Citations

This map shows the geographic impact of T. Karthick's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by T. Karthick with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites T. Karthick more than expected).

Fields of papers citing papers by T. Karthick

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by T. Karthick. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by T. Karthick. The network helps show where T. Karthick may publish in the future.

Co-authorship network of co-authors of T. Karthick

This figure shows the co-authorship network connecting the top 25 collaborators of T. Karthick. A scholar is included among the top collaborators of T. Karthick based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with T. Karthick. T. Karthick is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Karthick, T., et al.. (2024). χ-boundedness and related problems on graphs without long induced paths: A survey. Discrete Applied Mathematics. 364. 99–119. 2 indexed citations

Karthick, T., et al.. (2023). Improved bounds on the chromatic number of (P5, flag)-free graphs. Discrete Mathematics. 346(9). 113501–113501. 3 indexed citations

Chudnovsky, Maria, et al.. (2021). Square-Free Graphs with no Induced Fork. The Electronic Journal of Combinatorics. 28(2). 3 indexed citations

Karthick, T. & Frédéric Maffray. (2019). Square-Free Graphs with No Six-Vertex Induced Path. SIAM Journal on Discrete Mathematics. 33(2). 874–909. 12 indexed citations

Karthick, T., et al.. (2018). Chromatic bounds for some classes of 2K2-free graphs. Discrete Mathematics. 341(11). 3079–3088. 6 indexed citations

Karthick, T., et al.. (2018). On the Chromatic Number of ( $$P_6$$ P 6 , Diamond)-Free Graphs. Graphs and Combinatorics. 34(4). 677–692. 9 indexed citations

Brandstädt, Andreas, et al.. (2017). Efficient domination for classes of P6-free graphs. Discrete Applied Mathematics. 223. 15–27. 3 indexed citations

Karthick, T.. (2016). Weighted independent sets in a subclass of P6-free graphs. Discrete Mathematics. 339(4). 1412–1418. 5 indexed citations

Karthick, T.. (2016). Structure of squares and efficient domination in graph classes. Theoretical Computer Science. 652. 38–46. 1 indexed citations

10.

Karthick, T.. (2016). Independent sets in some classes of $$S_{i, j, k}$$ S i , j , k -free graphs. Journal of Combinatorial Optimization. 34(2). 612–630. 1 indexed citations

11.

Brandstädt, Andreas & T. Karthick. (2015). Weighted efficient domination in two subclasses of P6-free graphs. Discrete Applied Mathematics. 201. 38–46. 4 indexed citations

12.

Karthick, T. & Frédéric Maffray. (2015). Maximum weight independent sets in classes related to claw-free graphs. Discrete Applied Mathematics. 216. 233–239. 10 indexed citations

13.

Karthick, T., et al.. (2015). Weighted independent sets in classes of P6-free graphs. Discrete Applied Mathematics. 209. 217–226. 8 indexed citations

14.

Karthick, T.. (2014). Note on equitable colorings of graphs.. Australas. J Comb.. 59. 251–259. 2 indexed citations

15.

Karthick, T.. (2013). On atomic structure ofP5-free subclasses and Maximum Weight Independent Set problem. Theoretical Computer Science. 516. 78–85. 5 indexed citations

16.

Karthick, T. & C. R. Subramanian. (2013). Star coloring of subcubic graphs. Discussiones Mathematicae Graph Theory. 33(2). 373–373. 4 indexed citations

17.

Basavaraju, Manu, L. Sunil Chandran, & T. Karthick. (2012). Maximum weight independent sets in hole- and dart-free graphs. Discrete Applied Mathematics. 160(16-17). 2364–2369. 8 indexed citations

18.

Karthick, T. & Frédéric Maffray. (2011). A characterization of claw-free b-perfect graphs. Discrete Mathematics. 312(2). 324–330. 2 indexed citations

19.

Karthick, T., et al.. (2011). Bounding χ in terms of ω and Δ for some classes of graphs. Discrete Mathematics. 311(12). 911–920. 11 indexed citations

20.

Choudum, S.A. & T. Karthick. (2010). First-Fit coloring of {P5,K4−e}-free graphs. Discrete Applied Mathematics. 158(6). 620–626. 6 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact