Opuscula Math. 38, no. 3 (2018), 357-377
Forbidden configurations for hypohamiltonian graphs
Abstract. A graph \(G\) is called hypohamiltonian if \(G\) is not hamiltonian, but \(G-x\) is hamiltonian for each vertex \(x\) of \(G\). We present a list of 331 forbidden configurations which do not appear in hypohamiltonian graphs.
Keywords: hypohamiltonian graph, forbidden configuration, long cycle.
Mathematics Subject Classification: 05C38, 05C45.