Clique Chromatic Numbers of Intersection Graphs

被引：13

作者：

Zakharov, D. A. ^{[1
]}

Raigorodskii, A. M. ^{[2
,3
,4
,5
]}

机构：

[1] Natl Res Univ Higher Sch Econ, Moscow 101000, Russia

[2] Moscow Inst Phys & Technol, Dolgoprudnyi 141701, Moscow Oblast, Russia

[3] Lomonosov Moscow State Univ, Moscow 119991, Russia

[4] Adygeya State Univ, Maikop 385016, Russia

[5] Buryat State Univ, Ulan Ude 670000, Russia

来源：

MATHEMATICAL NOTES | 2019年 / 105卷 / 1-2期

基金：

俄罗斯基础研究基金会;

关键词：

intersection graph; clique chromatic number;

D O I：

10.1134/S0001434619010152

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

[No abstract available]

引用

页码：137 / 139

页数：3

共 18 条

[1] THE CHROMATIC NUMBER OF KNESER HYPERGRAPHS [J].

ALON, N ;

FRANKL, P ;

LOVASZ, L .

TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1986, 298 (01) :359-370

[2]

[Anonymous], 2016, GRAPHS COMBIN, V32

[3] Coloring the maximal cliques of graphs [J].

Bacsó, G ;

Gravier, S ;

Gyárfás, A ;

Preissmann, M ;

Sebo, A .

SIAM JOURNAL ON DISCRETE MATHEMATICS, 2004, 17 (03) :361-376

[4] Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection [J].

Bobu, A. V. ;

Kupriyanov, A. E. ;

Raigorodskii, A. M. .

SBORNIK MATHEMATICS, 2016, 207 (05) :652-677

[5]

Cherkashin D., 2018, DISCRETE APPL MATH

[6] Clique-coloring some classes of odd-hole-free graphs [J].

Defossez, David .

JOURNAL OF GRAPH THEORY, 2006, 53 (03) :233-249

[7]

Frankl P., 1981, COMBINATORICA

[8]

MacWilliams F.J., 1977, THEORY ERROR CORRECT

[9]

[Михайлов Кирилл Анатольевич Mikhailov Kirill Anatol'evich], 2009, [Математический сборник, Sbornik: Mathematics, Matematicheskii sbornik], V200, P63, DOI 10.4213/sm6373

[10]

Nagy Z., 1972, MAT LAPOK

← 1 2 →