Geodesic
On elementary theories of graphs and Abelian loops
Matematičeskie zametki, Tome 16 (1974) no. 6, pp. 957-968 
D. Ya. Kesel'man. On elementary theories of graphs and Abelian loops. Matematičeskie zametki, Tome 16 (1974) no. 6, pp. 957-968. http://geodesic.mathdoc.fr/item/MZM_1974_16_6_a12/
@article{MZM_1974_16_6_a12,
     author = {D. Ya. Kesel'man},
     title = {On elementary theories of graphs and {Abelian} loops},
     journal = {Matemati\v{c}eskie zametki},
     pages = {957--968},
     year = {1974},
     volume = {16},
     number = {6},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_1974_16_6_a12/}
}
TY  - JOUR
AU  - D. Ya. Kesel'man
TI  - On elementary theories of graphs and Abelian loops
JO  - Matematičeskie zametki
PY  - 1974
SP  - 957
EP  - 968
VL  - 16
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/MZM_1974_16_6_a12/
LA  - ru
ID  - MZM_1974_16_6_a12
ER  - 
%0 Journal Article
%A D. Ya. Kesel'man
%T On elementary theories of graphs and Abelian loops
%J Matematičeskie zametki
%D 1974
%P 957-968
%V 16
%N 6
%U http://geodesic.mathdoc.fr/item/MZM_1974_16_6_a12/
%G ru
%F MZM_1974_16_6_a12

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

The algorithmic decidability of elementary theories of certain classes of graphs, such as homogeneous, planar, bipartite planar, and critical nonplanar, is discussed. For the first three classes we prove the undecidability of elementary theories, and for the last, decidability with a supplementary predicate. We also prove the undecidability of theory of Abelian loops by an interpretation in it of theory of bipartite homogeneous 3rd degree graphs.