LOWER BOUNDS FOR THE CLIQUE AND THE CHROMATIC-NUMBERS OF A GRAPH

被引：52

|

作者：

EDWARDS, CS

ELPHICK, CH

机构：

来源：

DISCRETE APPLIED MATHEMATICS | 1983年 / 5卷 / 01期

关键词：

D O I：

10.1016/0166-218X(83)90015-X

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

收藏

页码：51 / 64

页数：14

相关论文

共 50 条

[41] Graphs with large clique-chromatic numbers
Wichianpaisarn, Tanawat
Uiyyasathian, Chariya
[J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2015, 7 (04)
[42] Bounds on eigenvalues and chromatic numbers
Cao, DS
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 1998, 270 : 1 - 13
[43] Distance Graphs with Large Chromatic Numbers and Small Clique Numbers
Kupavskii, A. B.
Raigorodskii, A. M.
[J]. DOKLADY MATHEMATICS, 2012, 85 (03) : 394 - 398
[44] Distance graphs with large chromatic numbers and small clique numbers
A. B. Kupavskii
A. M. Raigorodskii
[J]. Doklady Mathematics, 2012, 85 : 394 - 398
[45] Spectral Lower Bounds for the Quantum Chromatic Number of a Graph - Part II
Wocjan, Pawel
Elphick, Clive
Darbari, Parisa
[J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2020, 27 (04):
[46] UPPER BOUNDS ON ORDER OF A CLIQUE OF A GRAPH
AMIN, AT
[J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1972, 22 (04) : 569 - &
[47] NEW BOUNDS FOR CLIQUE NUMBER OF A GRAPH
SELKOW, SM
[J]. INFORMATION PROCESSING LETTERS, 1978, 7 (04) : 173 - 174
[48] Bounds to the Chromatic Polynomial of a Graph
Dohmen K.
[J]. Results in Mathematics, 1998, 33 (1-2) : 87 - 88
[49] THE DIFFERENCE BETWEEN THE CLIQUE NUMBERS OF A GRAPH
CACCETTA, L
ERDOS, P
ORDMAN, ET
PULLMAN, NJ
[J]. ARS COMBINATORIA, 1985, 19A (MAY) : 97 - 106
[50] STAR CHROMATIC-NUMBERS OF HYPERGRAPHS AND PARTIAL STEINER TRIPLE-SYSTEMS
HADDAD, L
ZHOU, H
[J]. DISCRETE MATHEMATICS, 1995, 146 (1-3) : 45 - 58

← 1 2 3 4 5 →