T. Karthick

Discret. Appl. Math., February, 2024

2023

Improved bounds on the chromatic number of (P5, flag)-free graphs.

[BibT_eX]

[DOI]

Discret. Math., September, 2023

A Hybrid Approach for Plant Disease Detection Using E-GAN and CapsNet.

[BibT_eX]

[DOI]

N. Vasudevan

Comput. Syst. Sci. Eng., 2023

Human Stress Recognition by Correlating Vision and EEG Data.

[BibT_eX]

[DOI]

S. Praveenkumar

Comput. Syst. Sci. Eng., 2023

On graphs with no induced P5 or K5-e.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Coloring of (P5, 4-wheel)-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

Optimal chromatic bound for (P2+P3, P2∓P3)-free graphs.

[BibT_eX]

[DOI]

CoRR, 2022

Coloring Graph Classes with no Induced Fork via Perfect Divisibility.

[BibT_eX]

[DOI]

Jenny Kaufmann

Vaidy Sivaraman

Electron. J. Comb., 2022

2021

On graphs with no induced five-vertex path or paraglider.

[BibT_eX]

[DOI]

Shenwei Huang

J. Graph Theory, 2021

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

[BibT_eX]

[DOI]

Manoj M. Belavadi

Discret. Math., 2021

Square-Free Graphs with no Induced Fork.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2020

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

[BibT_eX]

[DOI]

T. Kirthiga Devi

M. Ramprasath

Webology, 2020

Behaviour Cloning for Autonomous Driving.

[BibT_eX]

[DOI]

Webology, 2020

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

[BibT_eX]

[DOI]

T. Kirthiga Devi

R. Mohanakrishnan

Webology, 2020

Coloring graphs with no induced five-vertex path or gem.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Wheel-free graphs with no induced five-vertex path.

[BibT_eX]

[DOI]

CoRR, 2020

Primary user emulation attack mitigation using neural network.

[BibT_eX]

[DOI]

Vijayakumar Ponnusamy

Kottilingam Kottursamy

M. B. Mukesh Krishnan

Malathi Devarajan

Tariq Ahamed Ahanger

Comput. Electr. Eng., 2020

2019

Square-Free Graphs with No Six-Vertex Induced Path.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

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

[BibT_eX]

[DOI]

Manoj M. Belavadi

CoRR, 2019

Fog assisted IoT based medical cyber system for cardiovascular diseases affected patients.

[BibT_eX]

[DOI]

M. Manikandan

Concurr. Comput. Pract. Exp., 2019

Polynomial Cases for the Vertex Coloring Problem.

[BibT_eX]

[DOI]

Lucas Pastor

Algorithmica, 2019

2018

Coloring (gem, co-gem)-free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

On the Chromatic Number of (P6 , Diamond)-Free Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2018

Star Coloring of Certain Graph Classes.

[BibT_eX]

[DOI]

Graphs Comb., 2018

Chromatic bounds for some classes of 2K2-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

2017

Independent sets in some classes of Si, j, k-free graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Maximum weight independent sets in classes related to claw-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Efficient domination for classes of P6-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Coloring (P6, diamond, K4)-free graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Chromatic bounds for some classes of 2K2-free graphs.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Structure of squares and efficient domination in graph classes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Vizing Bound for the Chromatic Number on Some Graph Classes.

[BibT_eX]

[DOI]

Graphs Comb., 2016

Star chromatic bounds.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

Preface.

[BibT_eX]

[DOI]

Andreas M. Hinz

S. Arumugam

Rangaswami Balakrishnan

Electron. Notes Discret. Math., 2016

Weighted independent sets in a subclass of P6-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

Weighted independent sets in classes of P6-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Weighted efficient domination in two subclasses of P6-free graphs.

[BibT_eX]

[DOI]

Andreas Brandstädt

Discret. Appl. Math., 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

Independent Sets in Classes Related to Chair-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015

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

[BibT_eX]

[DOI]

CoRR, 2015

Weighted Efficient Domination in Classes of P6-free Graphs.

[BibT_eX]

[DOI]

Andreas Brandstädt

CoRR, 2015

New Polynomial Case for Efficient Domination in P 6-free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014

On atomic structure of P5-free subclasses and Maximum Weight Independent Set problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Note on equitable colorings of graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2014

2013

Star coloring subcubic graphs.

[BibT_eX]

[DOI]

C. R. Subramanian

Discuss. Math. Graph Theory, 2013

2012

A characterization of claw-free b-perfect graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Maximum weight independent sets in hole- and dart-free graphs.

[BibT_eX]

[DOI]

Manu Basavaraju

L. Sunil Chandran

Discret. Appl. Math., 2012

2011

Bounding χ in terms of ω and Δ for some classes of graphs.

[BibT_eX]

[DOI]

N. R. Aravind

C. R. Subramanian

Discret. Math., 2011

2010

Maximal cliques in {P2 UNION P3, C4}-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2010

First-Fit coloring of {P5, K4-e}-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Unmanned Air Vehicle Collision Avoidance System and Method for Safety Flying in Civilian Airspace.

[BibT_eX]

[DOI]

S. Aravind

Proceedings of the 3rd International Conference on Emerging Trends in Engineering and Technology, 2010

2008

Linear Chromatic Bounds for a Subfamily of 3 K 1-free Graphs.

[BibT_eX]

[DOI]

M. A. Shalu

Graphs Comb., 2008

2007

Perfect coloring and linearly chi-bound P6-free graphs.

[BibT_eX]

[DOI]