Lattice complete graphs
Diskretnyj analiz i issledovanie operacij, Tome 24 (2017) no. 4, pp. 22-33

Voir la notice de l'article provenant de la source Math-Net.Ru

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
Mots-clés : clique.
@article{DA_2017_24_4_a1,
     author = {Yu. E. Bessonov and A. A. Dobrynin},
     title = {Lattice complete graphs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {22--33},
     publisher = {mathdoc},
     volume = {24},
     number = {4},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2017_24_4_a1/}
}
TY  - JOUR
AU  - Yu. E. Bessonov
AU  - A. A. Dobrynin
TI  - Lattice complete graphs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2017
SP  - 22
EP  - 33
VL  - 24
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2017_24_4_a1/
LA  - ru
ID  - DA_2017_24_4_a1
ER  - 
%0 Journal Article
%A Yu. E. Bessonov
%A A. A. Dobrynin
%T Lattice complete graphs
%J Diskretnyj analiz i issledovanie operacij
%D 2017
%P 22-33
%V 24
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2017_24_4_a1/
%G ru
%F DA_2017_24_4_a1
Yu. E. Bessonov; A. A. Dobrynin. Lattice complete graphs. Diskretnyj analiz i issledovanie operacij, Tome 24 (2017) no. 4, pp. 22-33. http://geodesic.mathdoc.fr/item/DA_2017_24_4_a1/