%%visits: 7 This is a the first theorem that used a computer to solve. It states that certain graphs can always be coloured with 4 colours, such a map. %% ==intuition ## rigour The [[chromatic_number]] of a loopless planar_graph is at most 4. %% ==exam clinic %% ==examples and non-examples %% ==related tags math__discrete_mathematics: