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, 2010, Volume 381, Pages 5–30 (Mi znsl3850)  
Chromatic numbers of layered graphs with bounded maximal clique

S. L. Berlov

Physical and Mathematical Lyceum No. 239, St. Petersburg, Russia
Full-text PDF (759 kB)
References:
PDF
HTML
Abstract: A graph is called $n$-layered if the set of its vertices is a union of pairwise nonintersected $n$-cliques. We estimate chromatic numbers of $n$-layered graphs without $(n+1)$-cliques. Bibl. 10 titles.
Key words and phrases: chromatic number, clique, clique number, Hall's theorem.
Received: 10.11.2010
English version:
Journal of Mathematical Sciences (New York), 2011, Volume 179, Issue 5, Pages 579–591
DOI: https://doi.org/10.1007/s10958-011-0610-5
Bibliographic databases:
Document Type: Article
UDC: 519.174.7
Language: Russian
Citation: S. L. Berlov, “Chromatic numbers of layered graphs with bounded maximal clique”, Combinatorics and graph theory. Part II, Zap. Nauchn. Sem. POMI, 381, POMI, St. Petersburg, 2010, 5–30; J. Math. Sci. (N. Y.), 179:5 (2011), 579–591
Citation in format AMSBIB
\Bibitem{Ber10}
\by S.~L.~Berlov
\paper Chromatic numbers of layered graphs with bounded maximal clique
\inbook Combinatorics and graph theory. Part~II
\serial Zap. Nauchn. Sem. POMI
\yr 2010
\vol 381
\pages 5--30
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl3850}
\transl
\jour J. Math. Sci. (N. Y.)
\yr 2011
\vol 179
\issue 5
\pages 579--591
\crossref{https://doi.org/10.1007/s10958-011-0610-5}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-83055179307}
Linking options:
  • https://www.mathnet.ru/eng/znsl3850
  • https://www.mathnet.ru/eng/znsl/v381/p5
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:257
    Full-text PDF :93
    References:32
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024