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 条

[21] GENERALIZED CHROMATIC-NUMBERS OF RANDOM GRAPHS
BOLLOBAS, B
THOMASON, A
[J]. RANDOM STRUCTURES & ALGORITHMS, 1995, 6 (2-3) : 353 - 356
[22] CONDITIONAL CHROMATIC-NUMBERS WITH FORBIDDEN CYCLES
DARGEN, KC
FRAUGHNAUGH, K
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 1995, 217 : 53 - 66
[23] ON THE CHROMATIC-NUMBERS OF SPECIAL DISTANCE GRAPHS
VOIGT, M
WALTHER, H
[J]. DISCRETE MATHEMATICS, 1991, 97 (1-3) : 395 - 397
[24] Upper Bounds on the Chromatic Polynomial of a Connected Graph with Fixed Clique Number
Long, Shude
Ren, Han
[J]. GRAPHS AND COMBINATORICS, 2023, 39 (03)
[25] New analytical lower bounds on the clique number of a graph
Stozhkov, Vladimir
Pastukhov, Grigory
Boginski, Vladimir
Pasiliao, Eduardo L.
[J]. OPTIMIZATION METHODS & SOFTWARE, 2017, 32 (02): : 336 - 368
[26] Upper Bounds on the Chromatic Polynomial of a Connected Graph with Fixed Clique Number
Shude Long
Han Ren
[J]. Graphs and Combinatorics, 2023, 39
[27] ON THE INDEPENDENCE AND CHROMATIC-NUMBERS OF RANDOM REGULAR GRAPHS
FRIEZE, AM
LUCZAK, T
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1992, 54 (01) : 123 - 132
[28] A RAMSEY THEORETIC RESULT INVOLVING CHROMATIC-NUMBERS
BURR, SA
[J]. JOURNAL OF GRAPH THEORY, 1980, 4 (02) : 241 - 242
[29] Improved bounds for the product of the domination and chromatic numbers of a graph
Caro, Y
Roditty, Y
[J]. ARS COMBINATORIA, 2000, 56 : 189 - 191
[30] GRAPHS WITH SMALL CHROMATIC-NUMBERS ARE EASY TO COLOR
KUCERA, L
[J]. INFORMATION PROCESSING LETTERS, 1989, 30 (05) : 233 - 236

← 1 2 3 4 5 →