---
title: "How would we prove that every tree is properly colorable with just two colors?"  
description: "How would we prove that every tree is properly colorable with just two colors?"  
author: "Andy Simon"  
published: 2018-03-09  
canonical: https://answers.mindstick.com/qa/37603/how-would-we-prove-that-every-tree-is-properly-colorable-with-just-two-colors  
category: "math"  
tags: ["discrete math"]  
reading_time: 1 minute  

---

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

How would we prove that every tree is properly colorable with just two [colors](https://answers.mindstick.com/qa/31019/should-i-paint-my-interior-with-neutral-or-bright-colors)?

\


---

Original Source: https://answers.mindstick.com/qa/37603/how-would-we-prove-that-every-tree-is-properly-colorable-with-just-two-colors

Copyright © MindStick Software Pvt. Ltd. This Markdown version is provided for developers, AI systems, and offline reading.