Doklady Akademii Nauk SSSR
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Doklady Akademii 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
Full-text PDF (712 kB)
Presented: L. V. Kantorovich
Received: 12.06.1985
Bibliographic databases:
Document Type: Article
UDC: 519.1
Language: Russian
Citation: A. K. Kel'mans, “$3$-connected graphs without essential $3$-cuts and triangles”, Dokl. Akad. Nauk SSSR, 288:3 (1986), 531–535
Citation in format AMSBIB
\Bibitem{Kel86}
\by A.~K.~Kel'mans
\paper $3$-connected graphs without essential $3$-cuts and triangles
\jour Dokl. Akad. Nauk SSSR
\yr 1986
\vol 288
\issue 3
\pages 531--535
\mathnet{http://mi.mathnet.ru/dan8575}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=847782}
\zmath{https://zbmath.org/?q=an:0622.05043}
Linking options:
  • https://www.mathnet.ru/eng/dan8575
  • https://www.mathnet.ru/eng/dan/v288/i3/p531
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:79
    Full-text PDF :29
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024