Brooks graph

Материал из WEGA
Перейти к навигации Перейти к поиску

Brooks graph --- граф Брукса.

A Brooks graph is a connected graph that is neither a complete graph nor an odd cycle.

Brooks' Theorem. The chromatic number of a Brooks graph does not exceed its maximum degree.