The black-and-white coloring problem on distance hereditary graphs and strongly chordal graphs

Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai +1

Given a graph G and integers b and w. The black-and-white coloring problem asks if there exist disjoint sets of vertices B and W with |B|=b and |W|=w such that no vertex in B is ad…