7.19
Revision as of 01:05, 21 September 2020 by Algowikiadmin (talk | contribs) (Created page with "# This translates to the question of labeling the tree with two colors, because this way each edge's vertices are colored differently. The larger group of colors is the sought...")
- This translates to the question of labeling the tree with two colors, because this way each edge's vertices are colored differently. The larger group of colors is the sought for maximum-size independent set.
Back to Chapter 7
