D. A. Zakharov, A. M. Raigorodskii, “Clique Chromatic Numbers of Intersection Graphs”, Mat. Zametki, 105:1 (2019), 142–144; Math. Notes, 105:1 (2019), 137

Matematicheskie Zametki

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	General information
	Latest issue
	Forthcoming papers
	Archive
	Impact factor
	Guidelines for authors
	License agreement
	Submit a manuscript

	Search papers
	Search references

	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

Mat. Zametki:
Year:
Volume:
Issue:
Page:
	Find

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

Matematicheskie Zametki, 2019, Volume 105, Issue 1, Pages 142–144
DOI: https://doi.org/10.4213/mzm12097 (Mi mzm12097)

This article is cited in 18 scientific papers (total in 18 papers)

Brief Communications

Clique Chromatic Numbers of Intersection Graphs

D. A. Zakharov^a, A. M. Raigorodskii^bcde

^a National Research University Higher School of Economics, Moscow
^b Moscow Institute of Physics and Technology (State University), Dolgoprudny, Moscow region
^c Lomonosov Moscow State University
^d Adyghe State University, Maikop
^e Buryat State University, Ulan-Ude

Full-text PDF (314 kB) Citations (18)

References:

PDF

HTML

DOI: https://doi.org/10.4213/mzm12097

Keywords: intersection graph, clique chromatic number.

Funding agency	Grant number
Russian Foundation for Basic Research	18-01-00355
Ministry of Education and Science of the Russian Federation	НШ-6760.2018.1
This work was supported by the Russian Foundation for Basic Research under grant 18-01-00355 and by the Program of the President of the Russian Federation for the State Support of Leading Scientific Schools under grant NSh-6760.2018.1.

Received: 18.06.2018

English version:
Mathematical Notes, 2019, Volume 105, Issue 1, Pages 137–139
DOI: https://doi.org/10.1134/S0001434619010152

Bibliographic databases:

Document Type: Article

Language: Russian

Citation: D. A. Zakharov, A. M. Raigorodskii, “Clique Chromatic Numbers of Intersection Graphs”, Mat. Zametki, 105:1 (2019), 142–144; Math. Notes, 105:1 (2019), 137–139

Citation in format AMSBIB

\Bibitem{ZakRai19}

\by D.~A.~Zakharov, A.~M.~Raigorodskii

\paper Clique Chromatic Numbers of Intersection Graphs

\jour Mat. Zametki

\yr 2019

\vol 105

\issue 1

\pages 142--144

\mathnet{http://mi.mathnet.ru/mzm12097}

\crossref{https://doi.org/10.4213/mzm12097}

\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3894456}

\elib{https://elibrary.ru/item.asp?id=36603835}

\transl

\jour Math. Notes

\yr 2019

\vol 105

\issue 1

\pages 137--139

\crossref{https://doi.org/10.1134/S0001434619010152}

\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000464727500015}

\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85064263747}

Linking options:

https://www.mathnet.ru/eng/mzm12097

https://doi.org/10.4213/mzm12097

https://www.mathnet.ru/eng/mzm/v105/i1/p142

This publication is cited in the following 18 articles:

M.M. Ipatov, M.M. Koshelev, A.M. Raigorodskii, “Modularity of some distance graphs”, European Journal of Combinatorics, 117 (2024), 103833
Yu. A. Demidovich, M. E. Zhukovskii, “Chromatic Numbers of Distance Graphs without Short Odd Cycles in Rational Spaces”, Math. Notes, 109:5 (2021), 727–734
Mikhail Koshelev, “New lower bound on the modularity of Johnson graphs”, Moscow J. Comb. Number Th., 10:1 (2021), 77
Mikhail Ipatov, “Exact modularity of line graphs of complete graphs”, Moscow J. Comb. Number Th., 10:1 (2021), 61
Mikhail M. Koshelev, “Lower bounds on the clique-chromatic numbers of some distance graphs”, Moscow J. Comb. Number Th., 10:2 (2021), 141
Nikita Derevyanko, Mikhail Koshelev, Andrei Raigorodskii, Trends in Mathematics, 14, Extended Abstracts EuroComb 2021, 2021, 221
Ph. A. Pushnyakov, A. M. Raigorodskii, “Estimate of the Number of Edges in Special Subgraphs of a Distance Graph”, Math. Notes, 107:2 (2020), 322–332
K. Kovalenko, “On the independence number and the chromatic number of generalized preferential attachment models”, Discret Appl. Math., 285 (2020), 301–306
D. Zakharov, “Chromatic numbers of kneser-type graphs”, J. Comb. Theory Ser. A, 172 (2020), 105188
A. M. Raigorodskii, M. Koshelev, “New bounds for the clique-chromatic numbers of Johnson graphs”, Dokl. Math., 101:1 (2020), 66–67
A. M. Raigorodskii, M. M. Koshelev, “New bounds on clique-chromatic numbers of johnson graphs”, Discret Appl. Math., 283 (2020), 724–729
P. A. Ogarok, A. M. Raigorodskii, “On stability of the independence number of a certain distance graph”, Problems Inform. Transmission, 56:4 (2020), 345–357
Balogh J., Cherkashin D., Kiselev S., “Coloring General Kneser Graphs and Hypergraphs Via High-Discrepancy Hypergraphs”, Eur. J. Comb., 79 (2019), 228–236
A. A. Sagdeev, “On a Frankl–Wilson Theorem”, Problems Inform. Transmission, 55:4 (2019), 376–395
Kiselev S. Kupavskii A., “Sharp Bounds For the Chromatic Number of Random Kneser Graphs”, Acta Math. Univ. Comen., 88:3 (2019), 861–865
Pyaderkin M.M., “On the Chromatic Number of Random Subgraphs of a Certain Distance Graph”, Discret Appl. Math., 267 (2019), 209–214
Raigorodskii A.M. Shishunov E.D., “On the Independence Numbers of Distance Graphs With Vertices in (-1,0,1)(N)”, Dokl. Math., 100:2 (2019), 476–477
A. A. Sokolov, A. M. Raigorodskii, “O ratsionalnykh analogakh problem Nelsona–Khadvigera i Borsuka”, Chebyshevskii sb., 19:3 (2018), 270–281

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Statistics & downloads:
Abstract page:	582
Full-text PDF :	87
References:	54
First page:	44

Что такое QR-код?

Registration to the website

Logotypes