COVERING THE EDGES OF A RANDOM GRAPH BY CLIQUES

被引：13

|

作者：

FRIEZE, A

REED, B

机构：

[1] CARNEGIE MELLON UNIV,DEPT MATH,PITTSBURGH,PA 15213

[2] UNIV PARIS 06,CNRS,EQUIPE COMBINATOIRE,PARIS,FRANCE

来源：

COMBINATORICA | 1995年 / 15卷 / 04期

关键词：

Mathematics Subject Classification (1991): 05C80;

D O I：

10.1007/BF01192522

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

[No abstract available]

引用

收藏

页码：489 / 497

页数：9

相关论文

共 50 条

[1] Covering the Edges of a Random Hypergraph by Cliques
Rodl, Vojtech
Rucinski, Andrzej
[J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2022, 42 (04) : 1333 - 1349
[2] COVERING EDGES BY CLIQUES
BRODER, AZ
[J]. COMMUNICATIONS OF THE ACM, 1979, 22 (05) : 312 - 312
[3] On the Covering of the Vertices of a Graph by Cliques
Paul Erdos
[J]. Journal of Mathematical Research with Applications, 1982, (01) : 93 - 96
[4] COVERING ALL CLIQUES OF A GRAPH
TUZA, Z
[J]. DISCRETE MATHEMATICS, 1990, 86 (1-3) : 117 - 126
[5] COVERING THE CLIQUES OF A GRAPH WITH VERTICES
ERDOS, P
GALLAI, T
TUZA, Z
[J]. DISCRETE MATHEMATICS, 1992, 108 (1-3) : 279 - 289
[6] On covering all cliques of a chordal graph
Andreae, T
Flotow, C
[J]. DISCRETE MATHEMATICS, 1996, 149 (1-3) : 299 - 302
[7] COVERING THE EDGES OF A GRAPH BY CIRCUITS
KESELMAN, DY
[J]. CYBERNETICS, 1987, 23 (03): : 306 - 313
[8] Covering the edges of a graph with triangles
Bujtas, Csilla
Davoodi, Akbar
Ding, Laihao
Gyori, Ervin
Tuza, Zsolt
Yang, Donglei
[J]. DISCRETE MATHEMATICS, 2025, 348 (01)
[9] CONTENTMENT IN GRAPH THEORY - COVERING GRAPHS WITH CLIQUES
ORLIN, J
[J]. PROCEEDINGS OF THE KONINKLIJKE NEDERLANDSE AKADEMIE VAN WETENSCHAPPEN SERIES A-MATHEMATICAL SCIENCES, 1977, 80 (05): : 406 - 424
[10] COVERING EDGES BY CLIQUES WITH REGARD TO KEYWORD CONFLICTS AND INTERSECTION GRAPHS
KOU, LT
STOCKMEYER, LJ
WONG, CK
[J]. COMMUNICATIONS OF THE ACM, 1978, 21 (02) : 135 - 139

← 1 2 3 4 5 →