Publication date
May 2012
DOIAbstract
<p>Figure from Adleman 1994 (5). In the pictured directed graph, there is a unique Hamiltonian path from vertex 0 to vertex 6: 0123456.</p
<p>Figure from Adleman 1994 (5). In the pictured directed graph, there is a unique Hamiltonian path from vertex 0 to vertex 6: 0123456.</p
International audienceThe decision problems of the existence of a Hamiltonian cycle or of a Hamilton...
Bertossi and Bonuccelli [2] proved that the Hamiltonian Circuit problem in NP-Complete even when the...
AbstractIn 1968, L. Lovász conjectured that every connected, vertex-transitive graph had a Hamiltoni...
Copyright © 2014 M. Sohel Rahman et al. This is an open access article distributed under the Creativ...
A Hamiltonian path is a spanning path in a graph i.e. a path through every vertex. In this paper we ...
AbstractA graph G is called uniquely hamiltonian-connected from a vertex v if, for every vertex u ≠ ...
An algorithm for an NP-complete problem is presented, namely the existence of a Directed Hamiltonian...
AbstractA graph G is called uniquely hamiltonian-connected from a vertex ν of G if G contains exactl...
AbstractSince finding whether a graph has a Hamiltonian path or Hamiltonian cycle are both NP-comple...
A graph G is called hamiltonian-<:onnectedfrom a vertex v ifa hamiltonian path exists from v to e...
This paper proves a sufficient condition for the existence of Hamiltonian paths in simple connected ...
AbstractA graph G is called uniquely hamiltonian-connected from a vertex v if there is a unique v−x ...
AbstractIt is proved that there exists a path Pl(x,y) of length l if dAQn(x,y)≤l≤2n−1 between any tw...
AbstractIt is shown that every connected vertex-symmetric graph of order 5p (p a prime) has a Hamilt...
AbstractIn this paper a polynomial algorithm called the Minram algorithm is presented which finds a ...
International audienceThe decision problems of the existence of a Hamiltonian cycle or of a Hamilton...
Bertossi and Bonuccelli [2] proved that the Hamiltonian Circuit problem in NP-Complete even when the...
AbstractIn 1968, L. Lovász conjectured that every connected, vertex-transitive graph had a Hamiltoni...
Copyright © 2014 M. Sohel Rahman et al. This is an open access article distributed under the Creativ...
A Hamiltonian path is a spanning path in a graph i.e. a path through every vertex. In this paper we ...
AbstractA graph G is called uniquely hamiltonian-connected from a vertex v if, for every vertex u ≠ ...
An algorithm for an NP-complete problem is presented, namely the existence of a Directed Hamiltonian...
AbstractA graph G is called uniquely hamiltonian-connected from a vertex ν of G if G contains exactl...
AbstractSince finding whether a graph has a Hamiltonian path or Hamiltonian cycle are both NP-comple...
A graph G is called hamiltonian-<:onnectedfrom a vertex v ifa hamiltonian path exists from v to e...
This paper proves a sufficient condition for the existence of Hamiltonian paths in simple connected ...
AbstractA graph G is called uniquely hamiltonian-connected from a vertex v if there is a unique v−x ...
AbstractIt is proved that there exists a path Pl(x,y) of length l if dAQn(x,y)≤l≤2n−1 between any tw...
AbstractIt is shown that every connected vertex-symmetric graph of order 5p (p a prime) has a Hamilt...
AbstractIn this paper a polynomial algorithm called the Minram algorithm is presented which finds a ...
International audienceThe decision problems of the existence of a Hamiltonian cycle or of a Hamilton...
Bertossi and Bonuccelli [2] proved that the Hamiltonian Circuit problem in NP-Complete even when the...
AbstractIn 1968, L. Lovász conjectured that every connected, vertex-transitive graph had a Hamiltoni...
Add to ORKG