In the mathematical field of graph theory, the Harries graph or Harries (3-10)-cage is a 3-regular, undirected graph with 70 vertices and 105 edges.

[1] The Harries graph has chromatic number 2, chromatic index 3, radius 6, diameter 6, girth 10 and is Hamiltonian.

It is also a 3-vertex-connected and 3-edge-connected, non-planar, cubic graph.

It has book thickness 3 and queue number 2.

[4] The complete list of (3-10)-cage and the proof of minimality was given by O'Keefe and Wong in 1980.