Read on Wikipedia

Image: David Eppstein · CC0

Grötzsch's theorem

Grötzsch's theorem

Every triangle-free planar graph is 3-colorable.

Uncommon
10 views/day0 owners

No account needed. By playing, you confirm you're 13 or older and agree to the Terms of use.

No owners yet

UncommonTop 50%

Category: Empty

0 owners
0 copies
0 pulls
Wishlisted
0
In 0 albums
On 0 showcases
Market listings
0
Wikipedia views per dayLast 30 days 310

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 94 clicks on its links

  1. Four color theorem

    Planar maps require at most four colors.

    88%

  2. Triangle-free graph

    Graph without triples of adjacent vertices.

    12%

Readers come from

Share of the 104 readers arriving from another article

  1. Four color theorem

    Planar maps require at most four colors.

    89%