Please read abstract in the article.The DST-NRF Centre of Excellence in Mathematical and Statistical Sciences (CoE-MaSS), South Africa.http://www.elsevier.com/locate/dam2020-08-15hj2019Mathematics and Applied Mathematic
[[abstract]]A Hamiltonian graph G is panpositionably Hamiltonian if for any two distinct vertices x ...
We say a graph is locally P if the induced graph on the neighbourhood of every vertex has the proper...
In this article, we give a survey hamiltonian theorems, problems and conjectures in graph theorical ...
Please read abstract in the article.The University of South Africa and the National Research Foundat...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
Let be a property of a graph. A graph G is said to be locally , if the subgraph induced by the open...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
This is intended as a survey article covering recent developments in the area of hamiltonian graphs,...
This is intended as a survey article covering recent developments in the area of hamiltonian graphs,...
Please read abstract in the article.The DST-NRF Centre of Excellence in Mathematical and Statistical...
The classical global criteria for the existence of Hamilton cycles only apply to graphs with large e...
AbstractSince finding whether a graph has a Hamiltonian path or Hamiltonian cycle are both NP-comple...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
It is shown that every connected, locally connected graph with the maximum vertex degree Δ(G)=5 and ...
We consider the existence of Hamiltonian cycles for the locally connected graphs with a bounded vert...
[[abstract]]A Hamiltonian graph G is panpositionably Hamiltonian if for any two distinct vertices x ...
We say a graph is locally P if the induced graph on the neighbourhood of every vertex has the proper...
In this article, we give a survey hamiltonian theorems, problems and conjectures in graph theorical ...
Please read abstract in the article.The University of South Africa and the National Research Foundat...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
Let be a property of a graph. A graph G is said to be locally , if the subgraph induced by the open...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
This is intended as a survey article covering recent developments in the area of hamiltonian graphs,...
This is intended as a survey article covering recent developments in the area of hamiltonian graphs,...
Please read abstract in the article.The DST-NRF Centre of Excellence in Mathematical and Statistical...
The classical global criteria for the existence of Hamilton cycles only apply to graphs with large e...
AbstractSince finding whether a graph has a Hamiltonian path or Hamiltonian cycle are both NP-comple...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
It is shown that every connected, locally connected graph with the maximum vertex degree Δ(G)=5 and ...
We consider the existence of Hamiltonian cycles for the locally connected graphs with a bounded vert...
[[abstract]]A Hamiltonian graph G is panpositionably Hamiltonian if for any two distinct vertices x ...
We say a graph is locally P if the induced graph on the neighbourhood of every vertex has the proper...
In this article, we give a survey hamiltonian theorems, problems and conjectures in graph theorical ...
DOI
Add to ORKG