Doklady Akademii Nauk, Tome 288 (1986) no. 3, pp. 531-535
Citer cet article
A. K. Kel'mans. $3$-connected graphs without essential $3$-cuts and triangles. Doklady Akademii Nauk, Tome 288 (1986) no. 3, pp. 531-535. http://geodesic.mathdoc.fr/item/DAN_1986_288_3_a3/
@article{DAN_1986_288_3_a3,
author = {A. K. Kel'mans},
title = {$3$-connected graphs without essential $3$-cuts and triangles},
journal = {Doklady Akademii Nauk},
pages = {531--535},
year = {1986},
volume = {288},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DAN_1986_288_3_a3/}
}
TY - JOUR
AU - A. K. Kel'mans
TI - $3$-connected graphs without essential $3$-cuts and triangles
JO - Doklady Akademii Nauk
PY - 1986
SP - 531
EP - 535
VL - 288
IS - 3
UR - http://geodesic.mathdoc.fr/item/DAN_1986_288_3_a3/
LA - ru
ID - DAN_1986_288_3_a3
ER -
%0 Journal Article
%A A. K. Kel'mans
%T $3$-connected graphs without essential $3$-cuts and triangles
%J Doklady Akademii Nauk
%D 1986
%P 531-535
%V 288
%N 3
%U http://geodesic.mathdoc.fr/item/DAN_1986_288_3_a3/
%G ru
%F DAN_1986_288_3_a3
