How would we prove that every tree is properly colorable with just two colors?

Asked 7 years ago
Viewed 768 times
Ask Question

0

How would we prove that every tree is properly colorable with just two colors?


Andy Simon
asked by Andy Simon in math

0 Answer

Your Answer

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy