A BOUND GIVEN BY HS WILF FOR FINITE GRAPH CHROMATIC NUMBERS

被引：13

作者：

FINCK, HJ

SACHS, H

机构：

来源：

关键词：

D O I：

10.1002/mana.19690390415

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：373 / &

共 16 条

[1]

AARTS JM, 1962, MATH CENTRUM AMSTERD

[2]

[Anonymous], 1968, J COMBIN THEORY

[3] On colouring the nodes of a network [J].

Brooks, RL .

PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1941, 37 :194-197

[4]

Dirac G.A., 1957, P LOND MATH SOC, V3, P161

[5]

DIRAC GA, 1964, GENERALIZATIONS 5 CO, P21

[6]

DIRAC GA, 1960, MATH NACHR, V22, P51

[7]

Dirac Gabriel A., 1952, J LOND MATH SOC, V27, P85, DOI 10.1112/jlms/s1-27.1.85

[8] ON CHROMATIC NUMBER OF GRAPHS AND SET-SYSTEMS [J].

ERDOS, P ;

HAJNAL, A .

ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1966, 17 (1-2) :61-&

[9]

FINCK HJ, 1966, WISS Z TECHN HOCHSCH, V12, P243

[10]

GALLAI T, 1963, MATH I HUNG ACAD S A, V7