The black-and-white coloring problem on circle graphs

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

2012-02-09

arxiv.org/abs/1202.1896v2

Computer Science

Discrete Mathematics

This paper has been withdrawn by the author due to a critical mistake in the circle graph algorithm

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 two vertices x in B and y in W are adjacent. In this paper we show that
the problem is polynomial when restricted to permutation graphs and, more
generally, to circle graphs.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-156408