Search Results - "Sandeep, R.B."

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

“…For a class G of graphs, the objective of Subgraph Complementation toG is to find whether there exists a subset S of vertices of the input graph G such that…”
Get full text

Incompressibility of H-free edge modification problems: Towards a dichotomy by Marx, Dániel, Sandeep, R.B.

“…Given a graph G and an integer k, the H-free Edge Editing problem is to find whether there exist at most k pairs of vertices in G such that changing the…”
Get full text

The chromatic discrepancy of graphs by Aravind, N.R., Kalyanasundaram, Subrahmanyam, Sandeep, R.B., Sivadasan, Naveen

“…For a proper vertex coloring c of a graph G, let φc(G) denote the maximum, over all induced subgraphs H of G, the difference between the chromatic number χ(H)…”
Get full text

Perfectly colorable graphs by Sandeep, R.B.

“…We define a perfect coloring of a graph G as a proper coloring of G such that every connected induced subgraph H of G uses exactly ω ( H ) many colors where ω…”
Get full text