Perfect coloring and linearly chi-bound P6-free graphs. - Sheshayya A. Choudum; T. Karthick; M. A. Shalu (J. Graph Theory, 2007)

Linear Chromatic Bounds for a Subfamily of 3 K 1-free Graphs. - Sheshayya A. Choudum; T. Karthick; M. A. Shalu (Graphs Comb., 2008)

Unmanned Air Vehicle Collision Avoidance System and Method for Safety Flying in Civilian Airspace. - T. Karthick; S. Aravind (ICETET, 2010)

First-Fit coloring of {P5, K4-e}-free graphs. - Sheshayya A. Choudum; T. Karthick (Discret. Appl. Math., 2010)

Maximal cliques in {P2 UNION P3, C4}-free graphs. - Sheshayya A. Choudum; T. Karthick (Discret. Math., 2010)

Bounding χ in terms of ω and Δ for some classes of graphs. - N. R. Aravind; T. Karthick; C. R. Subramanian 001 (Discret. Math., 2011)

Maximum weight independent sets in hole- and dart-free graphs. - Manu Basavaraju; L. Sunil Chandran; T. Karthick (Discret. Appl. Math., 2012)

A characterization of claw-free b-perfect graphs. - T. Karthick; Frédéric Maffray (Discret. Math., 2012)

Star coloring subcubic graphs. - T. Karthick; C. R. Subramanian 001 (Discuss. Math. Graph Theory, 2013)

Note on equitable colorings of graphs. - T. Karthick (Australas. J Comb., 2014)

New polynomial case for efficient domination in $P_6$-free graphs. - T. Karthick (CoRR, 2014)

On atomic structure of P5-free subclasses and Maximum Weight Independent Set problem. - T. Karthick (Theor. Comput. Sci., 2014)

New Polynomial Case for Efficient Domination in P 6-free Graphs. - T. Karthick (CALDAM, 2015)

Weighted Efficient Domination in Classes of P6-free Graphs. - Andreas Brandstädt; T. Karthick (CoRR, 2015)

Weighted Independent Sets in a Subclass of $P_6$-free Graphs. - T. Karthick (CoRR, 2015)

Independent Sets in Classes Related to Chair-Free Graphs. - T. Karthick (CALDAM, 2016)

Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free Graphs. - T. Karthick; Frédéric Maffray (COCOON, 2016)

Independent Sets in Classes Related to Chair/Fork-free Graphs. - T. Karthick (CoRR, 2016)

Weighted efficient domination in two subclasses of P6-free graphs. - Andreas Brandstädt; T. Karthick (Discret. Appl. Math., 2016)

Weighted independent sets in classes of P6-free graphs. - T. Karthick; Frédéric Maffray (Discret. Appl. Math., 2016)

Weighted independent sets in a subclass of P6-free graphs. - T. Karthick (Discret. Math., 2016)

Preface. - Andreas M. Hinz; S. Arumugam 001; Rangaswami Balakrishnan; S. Francis Raj; T. Karthick; K. Somasundaram; Xuding Zhu (Electron. Notes Discret. Math., 2016)

Star chromatic bounds. - T. Karthick (Electron. Notes Discret. Math., 2016)

Vizing Bound for the Chromatic Number on Some Graph Classes. - T. Karthick; Frédéric Maffray (Graphs Comb., 2016)

Structure of squares and efficient domination in graph classes. - T. Karthick (Theor. Comput. Sci., 2016)

Chromatic bounds for some classes of 2K2-free graphs. - T. Karthick; Suchismita Mishra 001 (CoRR, 2017)

Coloring (P6, diamond, K4)-free graphs. - T. Karthick; Suchismita Mishra 001 (CoRR, 2017)

Efficient domination for classes of P6-free graphs. - Andreas Brandstädt; Elaine M. Eschen; Erik Friese; T. Karthick (Discret. Appl. Math., 2017)

Maximum weight independent sets in classes related to claw-free graphs. - T. Karthick; Frédéric Maffray (Discret. Appl. Math., 2017)

Independent sets in some classes of Si, j, k-free graphs. - T. Karthick (J. Comb. Optim., 2017)

Chromatic bounds for some classes of 2K2-free graphs. - T. Karthick; Suchismita Mishra 001 (Discret. Math., 2018)

Star Coloring of Certain Graph Classes. - T. Karthick (Graphs Comb., 2018)

On the Chromatic Number of (P6 , Diamond)-Free Graphs. - T. Karthick; Suchismita Mishra 001 (Graphs Comb., 2018)

Coloring (gem, co-gem)-free graphs. - T. Karthick; Frédéric Maffray (J. Graph Theory, 2018)

Polynomial Cases for the Vertex Coloring Problem. - T. Karthick; Frédéric Maffray; Lucas Pastor (Algorithmica, 2019)

Fog assisted IoT based medical cyber system for cardiovascular diseases affected patients. - T. Karthick; M. Manikandan (Concurr. Comput. Pract. Exp., 2019)

Structural domination and coloring of some (P7, C7)-free graphs. - Sheshayya A. Choudum; T. Karthick; Manoj M. Belavadi (CoRR, 2019)

Square-Free Graphs with No Six-Vertex Induced Path. - T. Karthick; Frédéric Maffray (SIAM J. Discret. Math., 2019)

Primary user emulation attack mitigation using neural network. - Vijayakumar Ponnusamy; Kottilingam Kottursamy; T. Karthick; M. B. Mukesh Krishnan; Malathi Devarajan; Tariq Ahamed Ahanger (Comput. Electr. Eng., 2020)

Wheel-free graphs with no induced five-vertex path. - Arnab Char; T. Karthick (CoRR, 2020)

Coloring graphs with no induced five-vertex path or gem. - Maria Chudnovsky; T. Karthick; Peter Maceli; Frédéric Maffray (J. Graph Theory, 2020)

Secure Message Broadcasting in VANET Using RSU based Authentication and Cascade Encryption. - T. Kirthiga Devi; R. Mohanakrishnan; T. Karthick (Webology, 2020)

Behaviour Cloning for Autonomous Driving. - T. Kirthiga Devi; Akshat Srivatsava; Kritesh Kumar Mudgal; Ranjnish Raj Jayanti; T. Karthick (Webology, 2020)

Effective Use of Big Data Planning and Analytics in Crop Planting. - T. Karthick; T. Kirthiga Devi; M. Ramprasath (Webology, 2020)

Square-Free Graphs with no Induced Fork. - Maria Chudnovsky; Shenwei Huang; T. Karthick; Jenny Kaufmann (Electron. J. Comb., 2021)

Structural domination and coloring of some (P7, C7)-free graphs. - Sheshayya A. Choudum; T. Karthick; Manoj M. Belavadi (Discret. Math., 2021)

On graphs with no induced five-vertex path or paraglider. - Shenwei Huang; T. Karthick (J. Graph Theory, 2021)

Coloring Graph Classes with no Induced Fork via Perfect Divisibility. - T. Karthick; Jenny Kaufmann; Vaidy Sivaraman (Electron. J. Comb., 2022)

Optimal chromatic bound for (P2+P3, P2∓P3)-free graphs. - Arnab Char; T. Karthick (CoRR, 2022)

Coloring of (P5, 4-wheel)-free graphs. - Arnab Char; T. Karthick (Discret. Math., 2022)

On graphs with no induced P5 or K5-e. - Arnab Char; T. Karthick (CoRR, 2023)

Human Stress Recognition by Correlating Vision and EEG Data. - S. Praveenkumar; T. Karthick (Comput. Syst. Sci. Eng., 2023)

A Hybrid Approach for Plant Disease Detection Using E-GAN and CapsNet. - N. Vasudevan; T. Karthick (Comput. Syst. Sci. Eng., 2023)

Improved bounds on the chromatic number of (P5, flag)-free graphs. - Arnab Char; T. Karthick (Discret. Math., 2023)

Coloring (P5, kite)-free graphs with small cliques. - Shenwei Huang; Yiao Ju; T. Karthick (Discret. Appl. Math., 2024)

χ-boundedness and related problems on graphs without long induced paths: A survey. - Arnab Char; T. Karthick (Discret. Appl. Math., 2025)

Optimal coloring of (P2 + P3, gem)-free graphs. - Arnab Char; T. Karthick (Discret. Math., 2025)

Coloring of (P2+P4, K4-e)-free graphs. - C. U. Angeliya; T. Karthick; S. Huang (CoRR, 2025)

On near optimal colorable graphs. - C. U. Angeliya; Arnab Char; T. Karthick (CoRR, 2025)