The black-and-white coloring problem on trees

Daniel Berend, Shira Zucker

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


Given a graph G and positive integers b and w, the black-and-white coloring problem asks about the existence of a partial vertex-coloring of G, with b vertices colored black and w white, such that there is no edge between a black and a white vertex. We suggest an improved algorithm for solving this problem on trees.

Original languageEnglish
Pages (from-to)133-152
Number of pages20
JournalJournal of Graph Algorithms and Applications
Issue number2
StatePublished - 1 Jan 2009

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science
  • Computer Science Applications
  • Geometry and Topology
  • Computational Theory and Mathematics


Dive into the research topics of 'The black-and-white coloring problem on trees'. Together they form a unique fingerprint.

Cite this