T. Karthick

activity

20152022

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 cs.DMShow all

4 papers · 1 filter

cs.DM2018

Square-free graphs with no six-vertex induced path

T. Karthick, Frederic Maffray

We elucidate the structure of $(P_{6}, C_{4})$ -free graphs by showing that every such graph either has a clique cutset, or a universal vertex, or belongs to several special classes of g…

cs.DM2016

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 $N P$ -co…

cs.DM2015★ 6 cited

Weighted Independent Sets in a Subclass of $P_{6}$ -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…

cs.DM2015★ 4 cited

Weighted Efficient Domination in Classes of $P_{6}$ -free Graphs

Andreas Brandstadt, T. Karthick

In a graph $G$ , an efficient dominating set is a subset $D$ of vertices such that $D$ is an independent set and each vertex outside $D$ has exactly one neighbor in $D$ . The Minimum…

Square-free graphs with no six-vertex induced path

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

Weighted Independent Sets in a Subclass of P6​-free Graphs

Weighted Efficient Domination in Classes of P6​-free Graphs

Weighted Independent Sets in a Subclass of $P_{6}$ -free Graphs

Weighted Efficient Domination in Classes of $P_{6}$ -free Graphs