Branches History Index

◀ ▲ ▶Branches / Graph-theory / Proposition: Chromatic Number and Maximum Vertex Degree

Proposition: Chromatic Number and Maximum Vertex Degree

In a simple graph $G$ with the maximum vertex degree $d$, the chromatic number obeys the following inequality:

$$\chi(G)\le d+1.$$

Table of Contents

Proofs: 1

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

Github:
bookofproofs

References

Bibliography

  1. Aldous Joan M., Wilson Robin J.: "Graphs and Applications - An Introductory Approach", Springer, 2000