Algorithm for monochromatic vertex-disconnection of graphs

Miao Fu, Yuqin Zhang

Let G be a vertex-colored graph. We call a vertex cut S of G a monochromatic vertex cut if the vertices of S are colored with the same color. The graph G is monochromatically verte…