Hamiltonian cycle - Open Access .click

Results 131 to 140 of about 2,059,443 (151)

Some of the next articles are maybe not open access.

Hamiltonian Cycles in Products of Graphs

Canadian Mathematical Bulletin, 1975
Let V(G) and E(G) denote the vertex set and the edge set of a graph G; let Kn denote the complete graph with n vertices and let Kn, m denote the complete bipartite graph on n and m vertices. A Hamiltonian cycle (Hamiltonian path, respectively) in a graph G is a cycle (path, respectively) in G that contains all the vertices of G.
openaire +1 more source

Disjoint Hamiltonian cycles in graphs

Australas. J Comb., 1999
Let \(G\) be a \(2(k+1)\)-connected graph with the property \(uv \notin E(G)\) implies max\(\{ d(u),d(v) \} \geq n/2 + 2k\). It is shown that if \(\delta (G) \geq 4k+3\) then \(G\) contains \(k+1\) Hamiltonian cycles with no common edges. These cycles are constructed from the disjoint Hamiltonian cycles of a certain complete graph created from \(G ...
Guojun Li, Chuanping Chen
openaire +2 more sources

Hamiltonian Cycles in Hypercubes With Faulty Edges

Information Sciences, 2014
Jia-Jie Liu, Yue-Li Wang
exaly

Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs

SIAM Journal on Computing, 1994
Jitender Singh Deogun, George Steiner
exaly

Embedding Hamiltonian Cycles Into Folded Hypercubes With Faulty Links

Journal of Parallel and Distributed Computing, 2001
Dajin Wang
exaly

On the Mutually Independent Hamiltonian Cycles in Faulty Hypercubes

Information Sciences, 2013
Riste Škrekovski, Petr Gregor, Vida Vukasinovic +2 more
exaly

Hamiltonian Cycles in Hypercubes With 2n-4 Faulty Edges

Information Sciences, 2012
Andrzej Szepietowski
exaly

On the Number of Hamiltonian Cycles in Triangulations With Few Separating Triangles

Journal of Graph Theory, 2018
Nico Van Cleemput, Jasper Souffriau
exaly