Email this article Lattice complete graphs
- Authors: Bessonov Y.E.1, Dobrynin A.A.2
-
Affiliations:
- All-Russian Institute of Scientific and Technical Information
- Sobolev Institute of Mathematics
- Issue: Vol 11, No 4 (2017)
- Pages: 481-485
- Section: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/212849
- DOI: https://doi.org/10.1134/S1990478917040032
- ID: 212849
Cite item
Open Access
Access granted
Subscription Access
Abstract
We study the properties of graphs that can be placed in a rectangular lattice so that all vertices located in the same (horizontal or vertical) row be adjacent. Some criterion is formulated for an arbitrary graph to be in the specified class.
Keywords
About the authors
Yu. E. Bessonov
All-Russian Institute of Scientific and Technical Information
Author for correspondence.
Email: bessonov-ye@rambler.ru
Russian Federation, ul. Usievicha 20, Moscow, 125190
A. A. Dobrynin
Sobolev Institute of Mathematics
Email: bessonov-ye@rambler.ru
Russian Federation, pr. Akad. Koptyuga 4, Novosibirsk, 630090
Supplementary files
