Branches History Index

◀ ▲ ▶Branches / Graph-theory / Lemma: Coloring of Trees

Lemma: Coloring of Trees

Any tree can be colored with $2$ colors.

Table of Contents

Proofs: 1

Mentioned in:

Proofs: 1

Thank you to the contributors under CC BY-SA 4.0!

Github:
bookofproofs

References

Bibliography

  1. Piotrowski, Andreas: Own Research, 2014