Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 11 - Section 11.5 - Minimum Spanning Trees - Supplementary Exercises - Page 805: 9

Answer

Showing that every forest can be colored using two colors.

Work Step by Step

--Color each connected component separately. For each of these connected components, -first root the tree, - then color all vertices at even levels red and all vertices at odd levels blue
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.

GradeSaver will pay $15 for your literature essays
GradeSaver will pay $25 for your college application essays
GradeSaver will pay $50 for your graduate school essays – Law, Business, or Medical
GradeSaver will pay $10 for your Community Note contributions