The black-and-white coloring problem on permutation graphs
classification
💻 cs.DS
keywords
problemblack-and-whitecoloringgraphspermutationvertexadjacentasks
read the original 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 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.