The black-and-white coloring problem on permutation graphs

Details The black-and-white coloring problem on permutation graphs The black-and-white coloring problem on permutation graphs

2012-01-31

arxiv.org/abs/1201.6421v1

Computer Science

Data Structures and Algorithms

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 permutation graphs.

Affiliated with

Also associated with

No associations

Rating

The black-and-white coloring problem on permutation 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 permutation 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 permutation graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-56443