Opuscula Mathematica (Jan 2018)

Forbidden configurations for hypohamiltonian graphs

  • Igor Fabrici,
  • Tomáš Madaras,
  • Mária Timková

DOI
https://doi.org/10.7494/OpMath.2018.38.3.357
Journal volume & issue
Vol. 38, no. 3
pp. 357 – 377

Abstract

Read online

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