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.

Источник — http://pco.iis.nsk.su/wega/index.php?title=Brooks_graph&oldid=6424