Yu. E. Bessonov, A. A. Dobrynin, “Lattice complete graphs”, Diskretn. Anal. Issled. Oper., 2017, Volume 24, Issue 4,Pages <nobr>22

Lattice complete graphs

Yu. E. Bessonov^a, A. A. Dobrynin^b

^a All-Russian Institute for Scientific and Technical Information, 20 Usievich St., 125190 Moscow, Russia
^b Sobolev Institute of Mathematics, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia

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. Illustr. 4, bibliogr. 23.

Keywords: graph, rectangular lattice, clique.

UDC: 519.17

Received: 20.06.2017
Revised: 17.07.2017

DOI: 10.17377/daio.2017.24.582