An upper bound on the chromatic number of a graph as the maximum degree plus 1

7 months ago
29
Science mathematics graph theory graph chromatic number proper coloring coloring degree maximum degree max degree

Episode 17.

An upper bound on the chromatic number of a graph as the maximum degree plus 1.

Theorem. The chromatic number of a graph is less or equal than the maximum degree plus 1.

The same video on YouTube:
https://youtu.be/y7qz-Y2ede8

The same video of Telegram:
https://t.me/mathematical_bunker/41

Loading comments...