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

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

2011-11-03

arxiv.org/abs/1111.0867v1

Mathematics

Combinatorics

Scientific paper

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 adjacent to any vertex in W. In this paper we show that the problem is polynomial when restricted to cographs, distance-hereditary graphs, interval graphs and strongly chordal graphs. We show that the problem is NP-complete on splitgraphs.

Affiliated with

Also associated with

No associations

Rating

The black-and-white coloring problem on distance hereditary graphs and strongly chordal graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The black-and-white coloring problem on distance hereditary graphs and strongly chordal graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The black-and-white coloring problem on distance hereditary graphs and strongly chordal graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-702748