Zapiski Nauchnykh Seminarov POMI
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


Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find




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

Zapiski Nauchnykh Seminarov POMI, 2011, Volume 391, Pages 149–156 (Mi znsl4571)  
This article is cited in 3 scientific papers (total in 3 papers)

An upper bound on the chromatic number of circle graphs without $K_4$

G. V. Nenashev

Saint-Petersburg State University, Saint-Petersburg, Russia
Full-text PDF (199 kB) Citations (3)
References:
PDF
HTML
Abstract: Let $G$ be a circle graph without clique on 4 vertices. We proof that the chromatic number of $G$ doesn't exceed 30.
Key words and phrases: circle graph, proper coloring, chromatic number.
Received: 20.09.2011
English version:
Journal of Mathematical Sciences (New York), 2012, Volume 184, Issue 5, Pages 629–633
DOI: https://doi.org/10.1007/s10958-012-0886-0
Bibliographic databases:
Document Type: Article
UDC: 519.174.7
Language: Russian
Citation: G. V. Nenashev, “An upper bound on the chromatic number of circle graphs without $K_4$”, Combinatorics and graph theory. Part III, Zap. Nauchn. Sem. POMI, 391, POMI, St. Petersburg, 2011, 149–156; J. Math. Sci. (N. Y.), 184:5 (2012), 629–633
Citation in format AMSBIB
\Bibitem{Nen11}
\by G.~V.~Nenashev
\paper An upper bound on the chromatic number of circle graphs without $K_4$
\inbook Combinatorics and graph theory. Part~III
\serial Zap. Nauchn. Sem. POMI
\yr 2011
\vol 391
\pages 149--156
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl4571}
\transl
\jour J. Math. Sci. (N. Y.)
\yr 2012
\vol 184
\issue 5
\pages 629--633
\crossref{https://doi.org/10.1007/s10958-012-0886-0}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84884310835}
Linking options:
  • https://www.mathnet.ru/eng/znsl4571
  • https://www.mathnet.ru/eng/znsl/v391/p149
    • 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:528
    Full-text PDF :66
    References:43
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024