Об одной оценке сложности теорий графов
Sibirskij matematiceskij zurnal (1996)
- Volume: 37, Issue: 3, page 700-703
- ISSN: 0037-4466; 1573-9260/e
Access Full Article
top
How to cite
topСудоплатов, С.В.. "Об одной оценке сложности теорий графов." Sibirskij matematiceskij zurnal 37.3 (1996): 700-703. <http://eudml.org/doc/63941>.
@article{Судоплатов1996,
author = {Судоплатов, С.В.},
journal = {Sibirskij matematiceskij zurnal},
keywords = {first-order theory; $n$-theory; weakly saturated graph; connected component; block; cycle; weakly saturated model; cutpoint},
language = {rus},
number = {3},
pages = {700-703},
publisher = {Izd. AN SSSR},
title = {Об одной оценке сложности теорий графов},
url = {http://eudml.org/doc/63941},
volume = {37},
year = {1996},
}
TY - JOUR
AU - Судоплатов, С.В.
TI - Об одной оценке сложности теорий графов
JO - Sibirskij matematiceskij zurnal
PY - 1996
PB - Izd. AN SSSR
VL - 37
IS - 3
SP - 700
EP - 703
LA - rus
KW - first-order theory; $n$-theory; weakly saturated graph; connected component; block; cycle; weakly saturated model; cutpoint
UR - http://eudml.org/doc/63941
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.