Doklady Akademii Nauk
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, 1995, Volume 340, Number 6, Pages 748–750 (Mi dan4546)  

MATHEMATICS

On the complexity of finite graphs

A. V. Chashkin

Lomonosov Moscow State University
Presented: N. S. Bakhvalov
Received: 21.12.1993
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: A. V. Chashkin, “On the complexity of finite graphs”, Dokl. Akad. Nauk, 340:6 (1995), 748–750
Citation in format AMSBIB
\Bibitem{Cha95}
\by A.~V.~Chashkin
\paper On the complexity of finite graphs
\jour Dokl. Akad. Nauk
\yr 1995
\vol 340
\issue 6
\pages 748--750
\mathnet{http://mi.mathnet.ru/dan4546}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1327847}
\zmath{https://zbmath.org/?q=an:0877.05058}
Linking options:
  • https://www.mathnet.ru/eng/dan4546
  • https://www.mathnet.ru/eng/dan/v340/i6/p748
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:100
    Full-text PDF :25
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024