One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage All Access membership.
Published in last 50 years
A theorem of Brooks guarantees that a maximum-degree-D graph can be properly colored with D colors if the graph does not contain a large complete subgraph. It is proved that finding such a coloring is in NC.