Cutting a tree with subgraph complementation is hard, except for some small trees von Antony, Dhanyamol, Pal, Sagartanu, Sandeep, R. B., Subashini, R.

Volltext

On Subgraph Complementation to H-free Graphs von Antony, Dhanyamol, Garchar, Jay, Pal, Sagartanu, Sandeep, R. B., Sen, Sagnik, Subashini, R.

Volltext

Algorithms for subgraph complementation to some classes of graphs von Antony, Dhanyamol, Pal, Sagartanu, Sandeep, R.B.

Volltext

Spanning caterpillar in biconvex bipartite graphs von Antony, Dhanyamol, Das, Anita, Gosavi, Shirish, Jacob, Dalu, Kulamarva, Shashanka

Volltext

Spanning caterpillar in biconvex bipartite graphs von Dhanyamol Antony, Das, Anita, Gosavi, Shirish, Dalu Jacob, Kulamarva, Shashanka

Volltext

Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees von Antony, Dhanyamol, Pal, Sagartanu, Sandeep, R. B., Subashini, R.

Volltext

Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness von Antony, Dhanyamol, Chandran, L. Sunil, Gayen, Ankit, Gosavi, Shirish, Jacob, Dalu

Volltext

On Subgraph Complementation to H-free Graphs von Antony, Dhanyamol, Garchar, Jay, Pal, Sagartanu, Sandeep, R. B., Sen, Sagnik, Subashini, R.

Volltext

Algorithms for subgraph complementation to some classes of graphs von Antony, Dhanyamol, Pal, Sagartanu, Sandeep, R. B

Volltext bestellen

Switching Classes: Characterization and Computation von Antony, Dhanyamol, Cao, Yixin, Pal, Sagartanu, Sandeep, R. B

Volltext bestellen

Graph Burning: Bounds and Hardness von Antony, Dhanyamol, Das, Anita, Gosavi, Shirish, Jacob, Dalu, Kulamarva, Shashanka

Volltext bestellen

Cutting a tree with Subgraph Complementation is hard, except for some small trees von Antony, Dhanyamol, Pal, Sagartanu, Sandeep, R. B, Subashini, R

Volltext bestellen

Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness von Antony, Dhanyamol, Chandran, L. Sunil, Gayen, Ankit, Gosavi, Shirish, Jacob, Dalu

Volltext bestellen

Algorithms for subgraph complementation to some classes of graphs von Dhanyamol Antony, Pal, Sagartanu, Sandeep, R B

Volltext

Switching Classes: Characterization and Computation von Dhanyamol Antony, Cao, Yixin, Pal, Sagartanu, Sandeep, R B

Volltext

Graph Burning: Bounds and Hardness von Dhanyamol Antony, Das, Anita, Gosavi, Shirish, Dalu Jacob, Kulamarva, Shashanka

Volltext

On subgraph complementation to H-free graphs von Antony, Dhanyamol, Garchar, Jay, Pal, Sagartanu, Sandeep, R. B, Sen, Sagnik, Subashini, R

Volltext bestellen

Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness von Dhanyamol Antony, L Sunil Chandran, Gayen, Ankit, Gosavi, Shirish, Dalu Jacob

Volltext

Cutting a tree with Subgraph Complementation is hard, except for some small trees von Dhanyamol Antony, Pal, Sagartanu, Sandeep, R B, Subashini, R

Volltext

On subgraph complementation to H-free graphs von Dhanyamol Antony, Garchar, Jay, Pal, Sagartanu, Sandeep, R B, Sen, Sagnik, Subashini, R

Volltext