Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Sib. Èlektron. Mat. Izv.:
Year:
Volume:
Issue:
Page:
Find




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

Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2004, Volume 1, Pages 99–109 (Mi semr9)  
This article is cited in 3 scientific papers (total in 3 papers)

Research papers

A lower bound for the chromatic number of graphs with a given maximal degree and girth

V. A. Tashkinov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Full-text PDF (204 kB) Citations (3)
References:
PDF
HTML
Abstract: For every $g\ge 3$ we prove the existence of a simple graph with maximum degree at most $6$, girth at least $g$ and chromatic number at least $4$.
Received December 1, 2004, published December 9, 2004
Bibliographic databases:
Document Type: Article
UDC: 519.17
MSC: 05C
Language: Russian
Citation: V. A. Tashkinov, “A lower bound for the chromatic number of graphs with a given maximal degree and girth”, Sib. Èlektron. Mat. Izv., 1 (2004), 99–109
Citation in format AMSBIB
\Bibitem{Tas04}
\by V.~A.~Tashkinov
\paper A lower bound for the chromatic number of graphs with a given maximal degree and girth
\jour Sib. \`Elektron. Mat. Izv.
\yr 2004
\vol 1
\pages 99--109
\mathnet{http://mi.mathnet.ru/semr9}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2132451}
\zmath{https://zbmath.org/?q=an:1076.05038}
Linking options:
  • https://www.mathnet.ru/eng/semr9
  • https://www.mathnet.ru/eng/semr/v1/p99
    • 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
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024