T. Karthick

Orcid: 0000-0002-5950-9093

According to our database1, T. Karthick authored at least 56 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Coloring (P5, kite)-free graphs with small cliques.
Discret. Appl. Math., February, 2024

2023
Improved bounds on the chromatic number of (<i>P</i><sub>5</sub>, flag)-free graphs.
Discret. Math., September, 2023

A Hybrid Approach for Plant Disease Detection Using E-GAN and CapsNet.
Comput. Syst. Sci. Eng., 2023

Human Stress Recognition by Correlating Vision and EEG Data.
Comput. Syst. Sci. Eng., 2023

On graphs with no induced P<sub>5</sub> or K<sub>5</sub>-e.
CoRR, 2023

2022
Coloring of (<i>P</i><sub>5</sub>, 4-wheel)-free graphs.
Discret. Math., 2022

Optimal chromatic bound for (P<sub>2</sub>+P<sub>3</sub>, P<sub>2</sub>∓P<sub>3</sub>)-free graphs.
CoRR, 2022

Coloring Graph Classes with no Induced Fork via Perfect Divisibility.
Electron. J. Comb., 2022

2021
On graphs with no induced five-vertex path or paraglider.
J. Graph Theory, 2021

Structural domination and coloring of some (P7, C7)-free graphs.
Discret. Math., 2021

Square-Free Graphs with no Induced Fork.
Electron. J. Comb., 2021

2020
Effective Use of Big Data Planning and Analytics in Crop Planting.
Webology, 2020

Behaviour Cloning for Autonomous Driving.
Webology, 2020

Secure Message Broadcasting in VANET Using RSU based Authentication and Cascade Encryption.
Webology, 2020

Coloring graphs with no induced five-vertex path or gem.
J. Graph Theory, 2020

Wheel-free graphs with no induced five-vertex path.
CoRR, 2020

Primary user emulation attack mitigation using neural network.
Comput. Electr. Eng., 2020

2019
An adaptive neuro-fuzzy logic based jamming detection system in WSN.
Soft Comput., 2019

Square-Free Graphs with No Six-Vertex Induced Path.
SIAM J. Discret. Math., 2019

Structural domination and coloring of some (P<sub>7</sub>, C<sub>7</sub>)-free graphs.
CoRR, 2019

Fog assisted IoT based medical cyber system for cardiovascular diseases affected patients.
Concurr. Comput. Pract. Exp., 2019

Polynomial Cases for the Vertex Coloring Problem.
Algorithmica, 2019

2018
Coloring (gem, co-gem)-free graphs.
J. Graph Theory, 2018

On the Chromatic Number of (P<sub>6</sub> , Diamond)-Free Graphs.
Graphs Comb., 2018

Star Coloring of Certain Graph Classes.
Graphs Comb., 2018

Chromatic bounds for some classes of 2K2-free graphs.
Discret. Math., 2018

2017
Independent sets in some classes of S<sub>i, j, k</sub>-free graphs.
J. Comb. Optim., 2017

Maximum weight independent sets in classes related to claw-free graphs.
Discret. Appl. Math., 2017

Efficient domination for classes of P<sub>6</sub>-free graphs.
Discret. Appl. Math., 2017

Coloring (P<sub>6</sub>, diamond, K<sub>4</sub>)-free graphs.
CoRR, 2017

Chromatic bounds for some classes of 2K<sub>2</sub>-free graphs.
CoRR, 2017

2016
Structure of squares and efficient domination in graph classes.
Theor. Comput. Sci., 2016

Vizing Bound for the Chromatic Number on Some Graph Classes.
Graphs Comb., 2016

Star chromatic bounds.
Electron. Notes Discret. Math., 2016

Preface.
Electron. Notes Discret. Math., 2016

Weighted independent sets in a subclass of P<sub>6</sub>-free graphs.
Discret. Math., 2016

Weighted independent sets in classes of P<sub>6</sub>-free graphs.
Discret. Appl. Math., 2016

Weighted efficient domination in two subclasses of P<sub>6</sub>-free graphs.
Discret. Appl. Math., 2016

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

Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free Graphs.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

Independent Sets in Classes Related to Chair-Free Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

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

Weighted Efficient Domination in Classes of P<sub>6</sub>-free Graphs.
CoRR, 2015

New Polynomial Case for Efficient Domination in P 6-free Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014
On atomic structure of P<sub>5</sub>-free subclasses and Maximum Weight Independent Set problem.
Theor. Comput. Sci., 2014

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

Note on equitable colorings of graphs.
Australas. J Comb., 2014

2013
Star coloring subcubic graphs.
Discuss. Math. Graph Theory, 2013

2012
A characterization of claw-free b-perfect graphs.
Discret. Math., 2012

Maximum weight independent sets in hole- and dart-free graphs.
Discret. Appl. Math., 2012

2011
Bounding χ in terms of ω and Δ for some classes of graphs.
Discret. Math., 2011

2010
Maximal cliques in {P<sub>2</sub> UNION P<sub>3</sub>, C<sub>4</sub>}-free graphs.
Discret. Math., 2010

First-Fit coloring of {P<sub>5</sub>, K<sub>4</sub>-e}-free graphs.
Discret. Appl. Math., 2010

Unmanned Air Vehicle Collision Avoidance System and Method for Safety Flying in Civilian Airspace.
Proceedings of the 3rd International Conference on Emerging Trends in Engineering and Technology, 2010

2008
Linear Chromatic Bounds for a Subfamily of 3 <i>K</i> <sub>1</sub>-free Graphs.
Graphs Comb., 2008

2007
Perfect coloring and linearly chi-bound <i>P</i><sub>6</sub>-free graphs.
J. Graph Theory, 2007


  Loading...