Overview

colourable


Show Summary Details

Quick Reference

A graph or map is said to be colourable if its chromatic number is finite. The Four Colour Theorem shows that all planar maps are colourable.

Subjects: Mathematics.


Reference entries

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