Please read abstract in the article.The University of South Africa and the National Research Foundation of South Africa for their sponsorship of the Salt Rock Workshops of 28 July–10 August 2013 and 20–30 January 2016, which contributed towards results in this paper. The authors thank the DST-NRF Centre of Excellence in Mathematical and Statistical Sciences (CoE-MaSS) for financial support, grant number BA2017/268. Opinions expressed and conclusions arrived at are those of the authors and are not necessarily to be attributed to the CoE-MaSS. This material is based upon the third author’s work supported by the National Research Foundation of S.A. under Grant number 81075 and the second author’s work supported by the National Research Fo...
AbstractSince finding whether a graph has a Hamiltonian path or Hamiltonian cycle are both NP-comple...
AbstractWe survey results and open problems in hamiltonian graph theory centered around three themes...
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian ...
We say a graph is locally P if the induced graph on the neighbourhood of every vertex has the proper...
Please read abstract in the article.The DST-NRF Centre of Excellence in Mathematical and Statistical...
Please read abstract in the article.The DST-NRF Centre of Excellence in Mathematical and Statistical...
Let be a property of a graph. A graph G is said to be locally , if the subgraph induced by the open...
AbstractWe consider the existence of Hamiltonian cycles for the locally connected graphs with a boun...
Hamiltonian cycles in graphs were first studied in the 1850s. Since then, animpressive amount of res...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
We consider the existence of Hamiltonian cycles for the locally connected graphs with a bounded vert...
In 1980 Bondy [2] proved that a (k+s)-connected graph of order n ≥ 3 is traceable (s = −1) or Hamilt...
We consider the existence of hamiltonian cycles for locally connected graphs with a bounded vertex ...
A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph is Hamilt...
AbstractSince finding whether a graph has a Hamiltonian path or Hamiltonian cycle are both NP-comple...
AbstractWe survey results and open problems in hamiltonian graph theory centered around three themes...
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian ...
We say a graph is locally P if the induced graph on the neighbourhood of every vertex has the proper...
Please read abstract in the article.The DST-NRF Centre of Excellence in Mathematical and Statistical...
Please read abstract in the article.The DST-NRF Centre of Excellence in Mathematical and Statistical...
Let be a property of a graph. A graph G is said to be locally , if the subgraph induced by the open...
AbstractWe consider the existence of Hamiltonian cycles for the locally connected graphs with a boun...
Hamiltonian cycles in graphs were first studied in the 1850s. Since then, animpressive amount of res...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
We consider the existence of Hamiltonian cycles for the locally connected graphs with a bounded vert...
In 1980 Bondy [2] proved that a (k+s)-connected graph of order n ≥ 3 is traceable (s = −1) or Hamilt...
We consider the existence of hamiltonian cycles for locally connected graphs with a bounded vertex ...
A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph is Hamilt...
AbstractSince finding whether a graph has a Hamiltonian path or Hamiltonian cycle are both NP-comple...
AbstractWe survey results and open problems in hamiltonian graph theory centered around three themes...
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian ...