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 条
  • [41] Cliques and Supercliques in a Graph
    Canoy Jr, Sergio R.
    Dela Cerna, Ramil H.
    Abragan, Armalene
    [J]. EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2023, 16 (01): : 243 - 252
  • [42] On the connected components of a random permutation graph with a given number of edges
    Acan, Huseyin
    Pittel, Boris
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2013, 120 (08) : 1947 - 1975
  • [43] Covering edges in networks
    Froehlich, Nicolas
    Maier, Andrea
    Hamacher, Horst W.
    [J]. NETWORKS, 2020, 75 (03) : 278 - 290
  • [44] How many random edges make a dense graph hamiltonian?
    Bohman, T
    Frieze, A
    Martin, R
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2003, 22 (01) : 33 - 42
  • [45] The Size of a Maximum Subgraph of the Random Graph with a Given Number of Edges
    N. M. Derevyanko
    M. E. Zhukovskii
    M. Rassias
    A. Yu. Skorkin
    [J]. Doklady Mathematics, 2019, 100 : 478 - 479
  • [46] The Size of a Maximum Subgraph of the Random Graph with a Given Number of Edges
    Derevyanko, N. M.
    Zhukovskii, M. E.
    Rassias, M.
    Skorkin, A. Yu.
    [J]. DOKLADY MATHEMATICS, 2019, 100 (02) : 478 - 479
  • [47] Coloring the edges of a random graph without a monochromatic giant component
    Spoehel, Reto
    Steger, Angelika
    Thomas, Henning
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
  • [48] Analysis of greedy algorithm for vertex covering of random graph by cubes
    Toman, Eduard
    Stanek, Martin
    [J]. COMPUTING AND INFORMATICS, 2006, 25 (05) : 393 - 404
  • [49] Covering symmetric supermodular functions with graph edges: A short proof of a theorem of Benczur and Frank
    Bernath, Attila
    [J]. INFORMATION PROCESSING LETTERS, 2017, 128 : 49 - 53
  • [50] ON THE PARTITION AND COLORING OF A GRAPH BY CLIQUES
    WALLIS, WD
    ZHANG, GH
    [J]. DISCRETE MATHEMATICS, 1993, 120 (1-3) : 191 - 203
12345