6 citations · 11 across the 4 of their papers we have counts for
5 papers
Structural domination and coloring of some ()-free graphs
S. A. Choudum, T. Karthick, Manoj M. Belavadi
We show that every connected induced subgraph of a graph is dominated by an induced connected split graph if and only if is -free, where is a set of six…
Coloring (, diamond, )-free graphs
T. Karthick, Suchismita Mishra
We show that every (, diamond, )-free graph is -colorable. Moreover, we give an example of a (, diamond, )-free graph with . This generalizes s…
Independent Sets in Classes Related to Chair/Fork-free Graphs
T. Karthick
The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. MWIS is known to be -co…
Weighted Independent Sets in a Subclass of -free Graphs
T. Karthick
The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. The complexity of the MWIS…
Weighted Efficient Domination in Classes of -free Graphs
Andreas Brandstadt, T. Karthick
In a graph , an efficient dominating set is a subset of vertices such that is an independent set and each vertex outside has exactly one neighbor in . The Minimum…