scholarly journals Hamiltonian cycles in circulant digraphs with two stripes

1997 ◽  
Vol 176 (1-3) ◽  
pp. 233-254 ◽  
Author(s):  
Qi Fan Yang ◽  
Rainer E. Burkard ◽  
Eranda Çela ◽  
Gerhard J. Woeginger
Keyword(s):  
Hamiltonian Cycles ◽  
Circulant Digraphs

scholarly journals Hamiltonian cycles in (2,3,c)-circulant digraphs

2009 ◽  
Vol 309 (17) ◽  
pp. 5484-5490 ◽  
Author(s):  
Dave Witte Morris ◽  
Joy Morris ◽  
Kerri Webb
Keyword(s):  
Hamiltonian Cycles ◽  
Circulant Digraphs

Hamiltonicity of a class of toroidal graphs

2020 ◽  
Vol 70 (2) ◽  
pp. 497-503
Author(s):  
Dipendu Maity ◽  
Ashish Kumar Upadhyay
Keyword(s):  
Connected Graph ◽  
Hamiltonian Cycle ◽  
Partial Solution ◽  
The Other ◽  
Hamiltonian Cycles ◽  
The Face ◽  
Toroidal Graphs

Abstract If the face-cycles at all the vertices in a map are of same type then the map is said to be a semi-equivelar map. There are eleven types of semi-equivelar maps on the torus. In 1972 Altshuler has presented a study of Hamiltonian cycles in semi-equivelar maps of three types {36}, {44} and {63} on the torus. In this article we study Hamiltonicity of semi-equivelar maps of the other eight types {33, 42}, {32, 41, 31, 41}, {31, 61, 31, 61}, {34, 61}, {41, 82}, {31, 122}, {41, 61, 121} and {31, 41, 61, 41} on the torus. This gives a partial solution to the well known Conjecture that every 4-connected graph on the torus has a Hamiltonian cycle.

scholarly journals Hamiltonian Cycles in Strong Products of Graphs

1979 ◽  
Vol 22 (3) ◽  
pp. 305-309 ◽  
Author(s):  
J. C. Bermond ◽  
A. Germa ◽  
M. C. Heydemann
Keyword(s):  
Connected Graph ◽  
Hamiltonian Cycles ◽  
Strong Product

Abstract. Let denote the graph (k times) where is the strong product of the two graphs G and H. In this paper we prove the conjecture of J. Zaks [3]: For every connected graph G with at least two vertices there exists an integer k = k(G) for which the graph is hamiltonian.

Infinite Circulant Digraphs and Random Infinite Circulant Digraphs

2002 ◽  
Vol 18 (4) ◽  
pp. 817-822 ◽  
Author(s):  
Qiang Xiang Huang ◽  
Ji Xiang Meng ◽  
Fu Ji Zhang
Keyword(s):  
Circulant Digraphs

scholarly journals Gaussian integral circulant digraphs

2011 ◽  
Vol 311 (1) ◽  
pp. 45-50 ◽  
Author(s):  
Ying Xu ◽  
Jixiang Meng
Keyword(s):  
Gaussian Integral ◽  
Circulant Digraphs

scholarly journals Finding hidden hamiltonian cycles

1994 ◽  
Vol 5 (3) ◽  
pp. 395-410 ◽  
Author(s):  
Andrei Z. Broder ◽  
Alan M. Frieze ◽  
Eli Shamir
Keyword(s):  
Hamiltonian Cycles

4-connected polyhedra have at least a linear number of hamiltonian cycles

2021 ◽  
Vol 97 ◽  
pp. 103395
Author(s):  
Gunnar Brinkmann ◽  
Nico Van Cleemput
Keyword(s):  
Hamiltonian Cycles
Sign in / Sign up

Export Citation Format

Share Document