Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Problemy Peredachi Informatsii, 1975, Volume 11, Issue 3, Pages 70–72 (Mi ppi1597)  
Large Systems

Determination of Hamiltonian Cycles of a Graph

V. V. Kiryukhin, D. V. Polonskii
Full-text PDF (201 kB)
Abstract: A simple algorithm for finding all Hamiltonian cycles of a graph is proposed.
Received: 21.01.1974
Revised: 04.06.1974
Bibliographic databases:
Document Type: Article
UDC: 621.395.74:519.14
Language: Russian
Citation: V. V. Kiryukhin, D. V. Polonskii, “Determination of Hamiltonian Cycles of a Graph”, Probl. Peredachi Inf., 11:3 (1975), 70–72; Problems Inform. Transmission, 11:3 (1975), 233–234
Citation in format AMSBIB
\Bibitem{KirPol75}
\by V.~V.~Kiryukhin, D.~V.~Polonskii
\paper Determination of Hamiltonian Cycles of a~Graph
\jour Probl. Peredachi Inf.
\yr 1975
\vol 11
\issue 3
\pages 70--72
\mathnet{http://mi.mathnet.ru/ppi1597}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=480177}
\zmath{https://zbmath.org/?q=an:0308.94033}
\transl
\jour Problems Inform. Transmission
\yr 1975
\vol 11
\issue 3
\pages 233--234
Linking options:
  • https://www.mathnet.ru/eng/ppi1597
  • https://www.mathnet.ru/eng/ppi/v11/i3/p70
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024