COUNTING COLORED GRAPHS OF HIGH CONNECTIVITY

被引：3

作者：

BOLLOBAS, B

机构：

来源：

CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES | 1981年 / 33卷 / 02期

关键词：

D O I：

10.4153/CJM-1981-041-2

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：476 / 484

页数：9

共 13 条

[1] DEGREE SEQUENCES OF RANDOM GRAPHS [J].

BOLLOBAS, B .

[2] UNIQUELY COLORABLE GRAPHS WITH LARGE GIRTH [J].

BOLLOBAS, B ;

SAUER, N .

CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1976, 28 (06) :1340-1344

[3]

BOLLOBAS B, 1979, GRAD TEXTS MATH, V63

[4]

Bollobas B., 1978, EXTREMAL GRAPH THEOR

[5]

Feller W., 1957, INTRO PROBABILITY TH

[6]

Gilbert E. N., 1956, CAN J MATH, V8, P405

[7] LABELED BIPARTITE BLOCKS [J].

HARARY, F ;

ROBINSON, RW .

CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1979, 31 (01) :60-68

[8]

Harary F., 1973, GRAPHICAL ENUMERATIO

[9]

Read R.C., 1960, CAN J MATH, V12, P410

[10] COLOURED GRAPHS - A CORRECTION AND EXTENSION [J].

READ, RC ;

WRIGHT, EM .

CANADIAN JOURNAL OF MATHEMATICS, 1970, 22 (03) :594-&