The black-and-white coloring problem on circle graphs
Discrete Mathematics
2012-03-20 v2
Abstract
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.
Keywords
Cite
@article{arxiv.1202.1896,
title = {The black-and-white coloring problem on circle graphs},
author = {Ton Kloks and Sheung-Hung Poon and Yue-Li Wang},
journal= {arXiv preprint arXiv:1202.1896},
year = {2012}
}
Comments
This paper has been withdrawn by the author due to a critical mistake in the circle graph algorithm