ON UNAVOIDABLE GRAPHS

被引：11
作者：
CHUNG, FRK
ERDOS, P
机构：
[1] BELL TEL LABS INC,MURRAY HILL,NJ 07974
[2] HUNGARIAN ACAD SCI,INST MATH,H-1053 BUDAPEST,HUNGARY
来源：
COMBINATORICA | 1983年 / 3卷 / 02期
关键词：
D O I：
10.1007/BF02579290
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：167 / 176
页数：10
相关论文
共 11 条
  • [1] Babai L., 1982, THEORY PRACTICE COMB, V60, P21
  • [2] Chung F.R.K., 1981, THEORY APPL GRAPHS, P265
  • [3] UNIVERSAL CATERPILLARS
    CHUNG, FRK
    GRAHAM, RL
    SHEARER, J
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1981, 31 (03) : 348 - 355
  • [4] GRAPHS WHICH CONTAIN ALL SMALL TREES
    CHUNG, FRK
    GRAHAM, RL
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1978, 24 (01) : 14 - 23
  • [5] MINIMAL DECOMPOSITIONS OF GRAPHS INTO MUTUALLY ISOMORPHIC SUBGRAPHS
    CHUNG, FRK
    ERDOS, P
    GRAHAM, RL
    [J]. COMBINATORICA, 1981, 1 (01) : 13 - 24
  • [6] CHUNG FRK, 1970, ANN NEW YORK ACADEMY, V319, P136
  • [7] CHUNG FRK, 1983, P LOND MATH SOC, V27, P203
  • [8] Erdos P., 1974, PROBABILISTIC METHOD
  • [9] Turan P., 1954, COLLOQ MATH-WARSAW, V3, P19
  • [10] Turan P., 1941, MAT FIZ LAPOK, V48, P436
12