Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Hamiltonian cycles i ...
Conference paper

Hamiltonian cycles in torical lattices

Vladimir K. Leontiev (1)
(1) Dorodnicyn Computing Centre of RAS
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2004
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
Proceedings
DOI
10.46298/dmtcs.3448
License
https://about.hal.science/hal-authorisation-v1
Indicators
508
Views
573
Downloads

Hamiltonian cycles in torical lattices

Vladimir K. Leontiev (1)
(1) Dorodnicyn Computing Centre of RAS
Abstract
We establish sufficient conditions for a toric lattice $T_{m,n}$ to be Hamiltonian. Also, we give some asymptotics for the number of Hamiltonian cycles in $T_{m,n}$.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • Hamiltonian cycle
  • toric lattice
  • Hardy―Littlewood method
Cited by

Source: OpenCitations

  • Not being (super)thin or solid is hard: A study of grid Hamiltonicity

    Computational Geometry

    Authors : Esther M. Arkin ORCID, Sándor P. Fekete ORCID, Kamrul Islam ORCID, Henk Meijer ORCID, Joseph S.B. Mitchell ORCID, Yurai Núñez-Rodríguez, Valentin Polishchuk, David Rappaport, Henry Xiao

    Journal reference : Volume 42, 2008, pp. 582-605

    DOI : 10.1016/j.comgeo.2008.11.004

  • On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer

    Lecture notes in computer science

    Authors : Gabriele Di Stefano ORCID, Alberto Petricola, Christos Zaroliagis ORCID

    Journal reference : Volume , 2006, pp. 406-417

    DOI : 10.1007/11946441_40
Preview
Loading PDF preview...