Opuscula Math. 38, no. 3 (2018), 357-377
https://doi.org/10.7494/OpMath.2018.38.3.357

Opuscula Mathematica

# Forbidden configurations for hypohamiltonian graphs

Igor Fabrici
Mária Timková

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.

Full text (pdf)