Brooks graph

Материал из WikiGrapp

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.

Литература

  • Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.