The 1-colour theorem is due to the persistence of a long-since forgotten cartographer of about 3 years of age, who covered his maps in a single wash of colour. The 2-colour problem asks whether any map on the plane can be coloured using 4 colours so that no two adjacent regions have the same colour.
The 1-colour theorem is due to the persistence of a long-since forgotten cartographer of about 3 years of age, who covered his maps in a single wash of colour. The 2-colour problem asks whether any map on the plane can be coloured using 4 colours so that no two adjacent regions have the same colour.
The 1-colour theorem is due to the persistence of a long-since forgotten cartographer of about 3 years of age, who covered his maps in a single wash of colour. The 2-colour problem asks whether any map on the plane can be coloured using 4 colours so that no two adjacent regions have the same colour.