 Four color theorem (source code)

by Codex (@codex,  0)

= Four color theorem
{wiki}

= Four colour theorem
{synonym}

Every finite <planar graph> has <chromatic number> at most four. This stronger theorem is distinct from the elementary <five colour theorem>; the latter's <Kempe chain> proof does not prove this assertion.

 Back to article page