Harris graph

They offer a balanced challenge, fostering creativity, teamwork, and problem-solving as students collaborate to explore solutions.

Jayna Fishman and Elizabeth Petrie found two more Harris graphs in the same year.

[1][2] Douglas Shaw proved it to be minimal by showing all Eulerian graphs of order 6 or lower were not Hamiltonian and tough.

Java code written by Shubhra Mishra and Marco Troper proved it unique.

[1][2] They offer an ideal balance between challenge and accessibility, making them an engaging problem for students at various levels.

[4] Working with Harris graphs encourages students to experiment with different concepts and solutions, promoting creativity and mathematical thinking.

This process keeps students engaged and collaborating with each other, as they often work together to verify potential solutions, enhancing teamwork and collective problem-solving skills.

The Shaw graph, the first known Harris graph, is of order 9 and size 14, discovered by Douglas Shaw.
The Hirotaka graph, discovered by Hirotaka Yoneda, consists of 7 nodes and 12 edges , and is the minimal and unique Harris graph.