Snark (graph theory)
Snark (graph theory)
3-regular graph with no 3-edge-coloring.
No account needed. By playing, you confirm you're 13 or older and agree to the Terms of use.
No owners yet
Category: Empty
- 0 owners
- 0 copies
- 0 pulls
- Wishlisted
- 0
- In 0 albums
- On 0 showcases
- Market listings
- 0
Not sold on the market yet.
Readers' pathsAug 2026 – Oct 2026
Readers go next to
Share of the 543 clicks on its links
Descartes snark
16%
Blanuša snarks
Two 3-regular graphs with 18 vertices and 27 edges.
11%
Flower snark
Infinite family of graphs.
11%
Szekeres snark
Szekeres snark with 50 tops and 75 edges.
9.6%
The Hunting of the Snark
1876 nonsense poem by Lewis Carroll.
7.6%
Petersen graph
Cubic graph with 10 vertices and 15 edges.
7.6%
Cycle double cover
Cycles in a graph that cover each edge twice.
5.2%
Four color theorem
Planar maps require at most four colors.
4.1%
Double-star snark
4.1%
Planar graph
Graph that can be embedded in the plane.
3.9%
Readers come from
Share of the 702 readers arriving from another article
Four color theorem
Planar maps require at most four colors.
55%
Petersen graph
Cubic graph with 10 vertices and 15 edges.
12%
Peter Guthrie Tait
Scottish mathematical physicist (1831–1901).
6%
Cycle double cover
Cycles in a graph that cover each edge twice.
4.8%
Flower snark
Infinite family of graphs.
4.4%
Hadwiger conjecture (graph theory)
Unproven generalization of the four-color theorem.
3.8%
Cubic graph
Graph with all vertices of degree 3.
2.7%
Faculty of Electrical Engineering and Computing, University of Zagreb
Technical faculty of the University of Zagreb.
1.4%