T. Karthick | DeepAI

DeepAI AI Chat

Featured Co-authors

Shenwei Huang
9 publications
Vaidy Sivaraman
5 publications
Jenny Kaufmann
3 publications
Frédéric Maffray
3 publications
Lucas Pastor
3 publications
Arnab Char
3 publications
S. A. Choudum
1 publication
Manoj M. Belavadi
1 publication
P. Maceli
1 publication
M. Chudnovsky
1 publication

∙ 08/16/2023

On graphs with no induced P_5 or K_5-e

In this paper, we are interested in some problems related to chromatic n...

0 Arnab Char, et al. ∙

∙ 05/16/2022

Optimal chromatic bound for (P_2+P_3, P̅_̅2̅+̅ ̅P̅_̅3̅)-free graphs

For a graph G, let χ(G) (ω(G)) denote its chromatic (clique) number. A P...

0 Arnab Char, et al. ∙

∙ 04/06/2021

Coloring graph classes with no induced fork via perfect divisibility

For a graph G, χ(G) will denote its chromatic number, and ω(G) its cliqu...

0 T. Karthick, et al. ∙

∙ 04/03/2020

Wheel-free graphs with no induced five-vertex path

A 4-wheel is the graph consisting of a chordless cycle on four vertices ...

0 Arnab Char, et al. ∙

∙ 07/11/2019

Structural domination and coloring of some (P_7, C_7)-free graphs

We show that every connected induced subgraph of a graph G is dominated ...

0 S. A. Choudum, et al. ∙

∙ 03/27/2019

On graphs with no induced five-vertex path or paraglider

Given two graphs H_1 and H_2, a graph is (H_1, H_2)-free if it contains ...

0 Shenwei Huang, et al. ∙

∙ 10/15/2018

Coloring graphs with no induced five-vertex path or gem

For a graph G, let χ(G) and ω(G) respectively denote the chromatic numbe...

0 M. Chudnovsky, et al. ∙

∙ 05/14/2018

Square-free graphs with no six-vertex induced path

We elucidate the structure of (P_6,C_4)-free graphs by showing that ever...

0 T. Karthick, et al. ∙

∙ 09/22/2017

Polynomial Cases for the Vertex Coloring Problem

The computational complexity of the Vertex Coloring problem is known for...

0 T. Karthick, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world