Lattice complete graphs


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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.

作者简介

Yu. Bessonov

All-Russian Institute of Scientific and Technical Information

编辑信件的主要联系方式.
Email: bessonov-ye@rambler.ru
俄罗斯联邦, ul. Usievicha 20, Moscow, 125190

A. Dobrynin

Sobolev Institute of Mathematics

Email: bessonov-ye@rambler.ru
俄罗斯联邦, pr. Akad. Koptyuga 4, Novosibirsk, 630090

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2017