Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnyi Analiz i Issledovanie Operatsii, 1996, Volume 3, Issue 4, Pages 28–34 (Mi da444)  
This article is cited in 3 scientific papers (total in 3 papers)

A very short proof of Dirac's theorem on the number of edges in chromatically critical graphs

V. A. Doibera, A. V. Kostochkab, H. Sachsc

a Bielefeld University
b Novosibirsk State University
c Technische Universität Ilmenau
Full-text PDF (589 kB) Citations (3)
Received: 27.08.1996
Bibliographic databases:
UDC: 519.17
Language: Russian
Citation: V. A. Doiber, A. V. Kostochka, H. Sachs, “A very short proof of Dirac's theorem on the number of edges in chromatically critical graphs”, Diskretn. Anal. Issled. Oper., 3:4 (1996), 28–34
Citation in format AMSBIB
\Bibitem{DoiKosSac96}
\by V.~A.~Doiber, A.~V.~Kostochka, H.~Sachs
\paper A~very short proof of Dirac's theorem on the number of edges in chromatically critical graphs
\jour Diskretn. Anal. Issled. Oper.
\yr 1996
\vol 3
\issue 4
\pages 28--34
\mathnet{http://mi.mathnet.ru/da444}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1490433}
\zmath{https://zbmath.org/?q=an:0920.05030}
Linking options:
  • https://www.mathnet.ru/eng/da444
  • https://www.mathnet.ru/eng/da/v3/i4/p28
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:1037
    Full-text PDF :531
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024