T. Karthick

activity

20142026

P_{5}

4

-wheel)-free graphs

8 citations · 28 across the 19 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

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…

math.CO2019★ 5 cited

On graphs with no induced five-vertex path or paraglider

Shenwei Huang, T. Karthick

Given two graphs $H_{1}$ and $H_{2}$ , a graph is $(H_{1}, H_{2})$ -free if it contains no induced subgraph isomorphic to $H_{1}$ or $H_{2}$ . For a positive integer $t$ , $P_{t}$ is the chordless…

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

On graphs with no induced five-vertex path or paraglider

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