scholarly journals Some new characterizations of Hamiltonian cycles in triangular grid graphs

2016 ◽  
Vol 201 ◽  
pp. 1-13
Author(s):  
Olga Bodroža-Pantić ◽  
Harris Kwong ◽  
Milan Pantić
2016 ◽  
Vol 32 (5) ◽  
pp. 1749-1761 ◽  
Author(s):  
Herman Z. Q. Chen ◽  
Sergey Kitaev ◽  
Brian Y. Sun
Keyword(s):  

2006 ◽  
Vol 39 (3) ◽  
pp. 149-154 ◽  
Author(s):  
Yury Orlovich ◽  
Valery Gordon ◽  
Frank Werner
Keyword(s):  

1994 ◽  
Vol 15 (3) ◽  
pp. 277-283 ◽  
Author(s):  
Y.H.Harris Kwong ◽  
D.G. Rogers

10.37236/4510 ◽  
2014 ◽  
Vol 21 (4) ◽  
Author(s):  
Ville H. Pettersson

A dynamic programming method for enumerating hamiltonian cycles in arbitrary graphs is presented. The method is applied to grid graphs, king's graphs, triangular grids, and three-dimensional grid graphs, and results are obtained for larger cases than previously published. The approach can easily be modified to enumerate hamiltonian paths and other similar structures.


2008 ◽  
Vol 308 (24) ◽  
pp. 6166-6188 ◽  
Author(s):  
Valery S. Gordon ◽  
Yury L. Orlovich ◽  
Frank Werner

2018 ◽  
Vol 38 (2) ◽  
pp. 405
Author(s):  
Olga Bodroža-PantiĆ ◽  
Rade Doroslovački ◽  
Harris Kwong ◽  
Milan PantiĆ

Sign in / Sign up

Export Citation Format

Share Document