Barnette's conjecture
Barnette's conjecture
Unsolved problem in graph theory.
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 1,050 clicks on its links
Hamiltonian path
Path in a graph that visits each vertex exactly once.
30%
Polyhedral graph
Graph made from vertices and edges of a convex polyhedron.
29%
Bipartite graph
Graph divided into two independent sets.
12%
Horton graph
4.8%
Graph theory
Area of discrete mathematics.
4%
Cubic graph
Graph with all vertices of degree 3.
3.8%
Vertex connectivity
Graph which remains connected when k or fewer nodes removed.
2%
Planar graph
Graph that can be embedded in the plane.
1.3%
NP-completeness
Complexity class.
1.3%
Conjecture
Proposition in mathematics that is unproven.
1%
Readers come from
Share of the 43 readers arriving from another article