📖 Chromatic Number

The chromatic number $\\chi(G)$ is the minimum number of colors needed to properly color the vertices of $G$ (adjacent vertices get different colors).

From: Introduction to Graph Theory

Learn more: https://west-graphs-deploy.vercel.app/#/section/14

Explore all courses: https://mathacademy-cyan.vercel.app

Reply to this note

Please Login to reply.

Discussion

No replies yet.