The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs

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.

[1]  D. Rose.  Triangulated graphs and the elimination process , 1970 .

[2]  Alexander Schrijver,et al.  Graphs whose neighborhoods have no special cycles , 1983, Discrete Mathematics.

[3]  A. Hoffman,et al.  Totally-Balanced and Greedy Matrices , 1985 .

[4]  Gen-Huey Chen,et al.  Dynamic Programming on Distance-Hereditary Graphs , 1997, ISAAC.

[5]  M. Yannakakis.  The Complexity of the Partial Order Dimension Problem , 1982 .

[6]  E. Howorka.  A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS , 1977 .

[7]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..

[8]  Pierre Hansen,et al.  Splitting trees , 1997, Discret. Math..

[9]  Peter L. Hammer,et al.  Difference graphs , 1990, Discret. Appl. Math..

[10]  Lorna Stewart,et al.  A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..

[11]  Russell Merris,et al.  Split graphs , 2003, Eur. J. Comb..

[12]  N. Mahadev,et al.  Threshold graphs and related topics , 1995 .

[13]  C. Lekkeikerker,et al.  Representation of a finite graph by a set of intervals on the real line , 1962 .

[14]  Richard P. Anstee,et al.  Characterizations of Totally Balanced Matrices , 1984, J. Algorithms.

[15]  Daniel Berend,et al.  The Black-and-White Coloring Problem on Trees , 2008, J. Graph Algorithms Appl..

[16]  Dieter Kratsch,et al.  Independent Sets in Asteroidal Triple-Free Graphs , 1997, SIAM J. Discret. Math..

[17]  B. Devadas Acharya,et al.  Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality , 1982 .

[18]  Jenö Lehel.  A characterization of totally balanced hypergraphs , 1985, Discret. Math..

[19]  Andries E. Brouwer,et al.  A super-balanced hypergraph has a nest point , 1980 .

[20]  F. Gavril.  The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

[21]  J. Moon.  The number of labeled k-trees , 1969 .

[22]  Martin Farber,et al.  Characterizations of strongly chordal graphs , 1983, Discret. Math..

[23]  Ton Kloks.  Treewidth, Computations and Approximations , 1994, Lecture Notes in Computer Science.

[24]  P. Gilmore,et al.  A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[25]  Lowell W. Beineke,et al.  The number of labeled k-dimensional trees , 1969 .

[26]  Donald J. ROSE,et al.  On simple characterizations of k-trees , 1974, Discret. Math..

[27]  P. Hammer,et al.  Aggregation of inequalities in integer programming. , 1975 .

[28]  Richard P. Anstee.  Hypergraphs with no special cycles , 1983, Comb..

[29]  Hans-Jürgen Bandelt,et al.  Distance-hereditary graphs , 1986, J. Comb. Theory, Ser. B.

[30]  G. Dirac.  On rigid circuit graphs , 1961 .

[31]  Kellogg S. Booth,et al.  Linear algorithms to recognize interval graphs and test for the consecutive ones property , 1975, STOC.

[32]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.