# Mária TimkováTechnical University of Kosice - Technicka univerzita v Kosiciach · Faculty of Electrical Engineering and Informatics

5
Publications
201
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
4
Citations
Citations since 2017
3 Research Items
2 Citations
Introduction

## Publications

Publications (5)
Article
A graph G is perihamiltonian if G itself is non-hamiltonian, yet every edge-contracted subgraph of G is hamiltonian. These graphs form a superclass of the hypohamiltonian graphs. By applying a recent result of Wiener on path-critical graphs, we prove the existence of infinitely many perihamiltonian graphs of connectivity k for any k ≥ 2. We also sh...
Article
The H-force number of a hamiltonian graph G is the smallest number k with the property that there exists a set W ⊆ V (G), |W| = k, such that each cycle passing through all vertices of W is hamiltonian. In this paper, we determine the H-force number of circulant graphs.
Article
Full-text available
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.
Article
The H-force number of a hamiltonian graph G is the smallest number k with the property that there exists a set W ⊆ V (G), |W| = k, such that each cycle passing through all vertices of W is hamiltonian. In this paper, we determine the H-force numbers of distance graphs with two parameters.
Article
Full-text available
The H-force number of a hamiltonian graph G is the smallest number k with the property that there exists a set W ⊆ V (G) with |W| = k such that each cycle passing through all vertices of W is a hamiltonian cycle. In this paper, we determine the H-force numbers of generalized dodecahedra.