Overview

chromatic number


Show Summary Details

Quick Reference

For a graph or map G, the maximum number of colours needed so that all regions touching one another (meeting at an edge or a vertex) are in a different colour is the chromatic number, denoted by χ(G). The Four Colour Theorem proved that χ(G)≤4 for all planar graphs.

Subjects: Mathematics.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.