T. Karthick

activity

20152025

most citedWeighted Independent Sets in a Subclass of

P_{6}

-free Graphs

6 citations · 16 across the 8 of their papers we have counts for

collaborators

Showing math.COShow all

8 papers · 1 filter

math.CO2025

Reconfiguration graph for vertex colorings for ( $P_{2}$ + $P_{3}$ , $C_{4}$ )-free graphs

M. Belavadi, T. Karthick

For a graph $G$ , let $χ (G)$ denote the chromatic number of $G$ . Given a graph $G$ , the $r eco n f i g u r a t i o n$ $g r a p h$ $f or$ $t h e$ $k$ - $co l or in g s$ of $G$ , denoted by $R_{k} (G)$ , is…

math.CO2025

( $P_{2} + P_{4}$ , $K_{4} - e$ )-free graphs are nearly $ω$ -colorable

C. U. Angeliya, T. Karthick, Shenwei Huang

For a graph $G$ , $χ (G)$ and $ω (G)$ respectively denote the chromatic number and clique number of $G$ . In this paper, we show the following results: (i) If $G$ is a ( $P_{2} + P_{4}$ , $K_4…

math.CO2022

Optimal chromatic bound for ( $P_{2} + P_{3}$ , $P_{2} + P_{3} ˉ$ )-free graphs

Arnab Char, T. Karthick

For a graph $G$ , let $χ (G)$ ( $ω (G)$ ) denote its chromatic (clique) number. A $P_{2} + P_{3}$ is the graph obtained by taking the disjoint union of a two-vertex path $P_{2}$ and a three-ver…

math.CO2022

Coloring ( $P_{5}$ , kite)-free graphs

Shenwei Huang, Yiao Ju, T. Karthick

Let $P_{n}$ and $K_{n}$ denote the induced path and complete graph on $n$ vertices, respectively. The {\em kite} is the graph obtained from a $P_{4}$ by adding a vertex and making it adj…

math.CO2021

Coloring graph classes with no induced fork via perfect divisibility

T. Karthick, Jenny Kaufmann, Vaidy Sivaraman

For a graph $G$ , $χ (G)$ will denote its chromatic number, and $ω (G)$ its clique number. A graph $G$ is said to be perfectly divisible if for all induced subgraphs $H$ of $G$ , $V(H)…

math.CO2019★ 1 cited

Structural domination and coloring of some ( $P_{7}, C_{7}$ )-free graphs

S. A. Choudum, T. Karthick, Manoj M. Belavadi

We show that every connected induced subgraph of a graph $G$ is dominated by an induced connected split graph if and only if $G$ is $C$ -free, where $C$ is a set of six…

Reconfiguration graph for vertex colorings for (P2​+P3​, C4​)-free graphs

(P2​+P4​, K4​−e)-free graphs are nearly ω-colorable

Optimal chromatic bound for (P2​+P3​, P2​+P3​ˉ​)-free graphs

Coloring (P5​, kite)-free graphs