RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






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


Diskretn. Anal. Issled. Oper., 2015, Volume 22, Number 2, Pages 27–48 (Mi da811)  

Cyclic properties of topological graphs of a hexagonal grid

P. A. Irzhavski

Belarusian State University, 4 Nezavisimosti Ave., 220030 Minsk, Belarus

Abstract: We study cyclic properties of topological graphs of a hexagonal grid. A sufficient condition for Hamiltonicity of such graphs is obtained. We find the smallest $2$-connected non-Hamiltonian topological graph of a hexagonal grid. An upper bound for the shortness coefficient of this class of graphs is established. Ill. 17, bibliogr. 18.

Keywords: plane graph, hexagonal grid, Hamilton cycle, shortness coefficient.

DOI: https://doi.org/10.17377/daio.2015.22.440

Full text: PDF file (374 kB)
References: PDF file   HTML file

English version:
Journal of Applied and Industrial Mathematics, 2015, 9:3, 367–380

Bibliographic databases:

UDC: 519.17
Received: 16.02.2014
Revised: 05.08.2014

Citation: P. A. Irzhavski, “Cyclic properties of topological graphs of a hexagonal grid”, Diskretn. Anal. Issled. Oper., 22:2 (2015), 27–48; J. Appl. Industr. Math., 9:3 (2015), 367–380

Citation in format AMSBIB
\Bibitem{Irz15}
\by P.~A.~Irzhavski
\paper Cyclic properties of topological graphs of a~hexagonal grid
\jour Diskretn. Anal. Issled. Oper.
\yr 2015
\vol 22
\issue 2
\pages 27--48
\mathnet{http://mi.mathnet.ru/da811}
\crossref{https://doi.org/10.17377/daio.2015.22.440}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3444476}
\elib{http://elibrary.ru/item.asp?id=23134005}
\transl
\jour J. Appl. Industr. Math.
\yr 2015
\vol 9
\issue 3
\pages 367--380
\crossref{https://doi.org/10.1134/S1990478915030084}


Linking options:
  • http://mi.mathnet.ru/eng/da811
  • http://mi.mathnet.ru/eng/da/v22/i2/p27

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Дискретный анализ и исследование операций
    Number of views:
    This page:204
    Full text:111
    References:14
    First page:10

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020