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
Tomáš Madaras
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)

  • Igor Fabrici
  • P.J. Šafárik University in Košice, Faculty of Science, Institute of Mathematics, Jesenná 5, 040 01 Košice, Slovakia
  • Tomáš Madaras
  • P.J. Šafárik University in Košice, Faculty of Science, Institute of Mathematics, Jesenná 5, 040 01 Košice, Slovakia
  • Mária Timková
  • Technical University of Košice, Faculty of Electrical Engineering and Informatics, Department of Mathematics and Theoretical Informatics, Němcovej 32, 042 00 Košice, Slovakia
  • Communicated by Adam Paweł Wojda.
  • Received: 2017-10-12.
  • Revised: 2018-01-26.
  • Accepted: 2018-02-03.
  • Published online: 2018-03-19.
Opuscula Mathematica - cover

Cite this article as:
Igor Fabrici, Tomáš Madaras, Mária Timková, Forbidden configurations for hypohamiltonian graphs, Opuscula Math. 38, no. 3 (2018), 357-377, https://doi.org/10.7494/OpMath.2018.38.3.357

Download this article's citation as:
a .bib file (BibTeX),
a .ris file (RefMan),
a .enw file (EndNote)
or export to RefWorks.

In accordance with EU legislation we advise you this website uses cookies to allow us to see how the site is used. All data is anonymized.
All recent versions of popular browsers give users a level of control over cookies. Users can set their browsers to accept or reject all, or certain, cookies.