Bipartization of graphs

Mateusz Miotk, Jerzy Topp, Paweł Żyliński

A dominating set of a graph $G$ is a set $D\subseteq V_G$ such that every vertex in $V_G-D$ is adjacent to at least one vertex in $D$, and the domination number $\gamma (G)$ of $G$ is th…