RUS  ENG
Full version
JOURNALS // Doklady Akademii Nauk // Archive

Dokl. Akad. Nauk SSSR, 1986 Volume 288, Number 3, Pages 531–535 (Mi dan8575)

MATHEMATICS

$3$-connected graphs without essential $3$-cuts and triangles

A. K. Kel'mans

Institute of Control Sciences, Moscow

UDC: 519.1

Presented: L. V. Kantorovich
Received: 12.06.1985



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024