Harris graph
id:
harris-graph-212-2491198
title:
Harris graph
text:
In graph theory, a Harris graph is defined as an Eulerian, tough, non-Hamiltonian graph. Harris graphs were introduced in 2013 when, at the University of Michigan, Harris Spungen conjectured that a tough, Eulerian graph would also necessarily be Hamiltonian. However, Douglas Shaw disproved this conjecture, discovering a counterexample with an order of 9 and a size of 14. Currently, there are 241,375 known Harris graphs. The minimal Harris graph, the Hirotaka graph, has an order of 7 and a size o
brand slug:
wiki
category slug:
encyclopedia
description:
Eulerian, non-hamiltonian, tough graph.
original url:
https://en.wikipedia.org/wiki/Harris_graph
date created:
2024-07-05T02:50:42Z
date modified:
2024-09-12T06:28:37Z
main entity:
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/b/b8/Shaw_Graph.png","width":618,"height":476}
fields total:
13
integrity:
15