CodeChef - Named after British astronomer Alexander Stewart Herschel, the Herschel graph is a bipartite undirected graph with 11 vertices and 18 edges, the smallest non-Hamiltonian polyhedral graph. #CodeChef #DidYouKnow #Technology #Programming | Facebook
![The Herschel graph is the smallest possible polyhedral graph that does not have a Hamiltonian cycle. | Graphing, New century, Herschel The Herschel graph is the smallest possible polyhedral graph that does not have a Hamiltonian cycle. | Graphing, New century, Herschel](https://i.pinimg.com/originals/a8/25/9f/a8259f68546a2a8615c7a02a2131a617.png)