On covering all cliques of a chordal graph

被引：0

|

作者：

Mathematisches Seminar, Universität Hamburg, Bundesstr. 55, D-20146 Hamburg, Germany ^{[1
]}

机构：

来源：

Discrete Math | / 1-3卷 / 299-302期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

8

引用

收藏

相关论文

共 50 条

[1] On covering all cliques of a chordal graph
Andreae, T
Flotow, C
DISCRETE MATHEMATICS, 1996, 149 (1-3) : 299 - 302
[2] COVERING ALL CLIQUES OF A GRAPH
TUZA, Z
DISCRETE MATHEMATICS, 1990, 86 (1-3) : 117 - 126
[3] On the Covering of the Vertices of a Graph by Cliques
Paul Erdos
数学研究与评论, 1982, (01) : 93 - 96
[4] COVERING THE CLIQUES OF A GRAPH WITH VERTICES
ERDOS, P
GALLAI, T
TUZA, Z
DISCRETE MATHEMATICS, 1992, 108 (1-3) : 279 - 289
[5] COVERING THE EDGES OF A RANDOM GRAPH BY CLIQUES
FRIEZE, A
REED, B
COMBINATORICA, 1995, 15 (04) : 489 - 497
[6] CONTENTMENT IN GRAPH THEORY - COVERING GRAPHS WITH CLIQUES
ORLIN, J
PROCEEDINGS OF THE KONINKLIJKE NEDERLANDSE AKADEMIE VAN WETENSCHAPPEN SERIES A-MATHEMATICAL SCIENCES, 1977, 80 (05): : 406 - 424
[7] A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
Berry, Anne
Pogorelcnik, Romain
INFORMATION PROCESSING LETTERS, 2011, 111 (11) : 508 - 511
[8] DOMINATING CLIQUES IN CHORDAL GRAPHS
KRATSCH, D
DAMASCHKE, P
LUBIW, A
DISCRETE MATHEMATICS, 1994, 128 (1-3) : 269 - 275
[9] FINDING ALL CLIQUES OF AN UNDIRECTED GRAPH [H]
BRON, C
KERBOSCH, J
COMMUNICATIONS OF THE ACM, 1973, 16 (09) : 575 - 577
[10] Listing all potential maximal cliques of a graph
Bouchitté, V
Todinca, I
THEORETICAL COMPUTER SCIENCE, 2002, 276 (1-2) : 17 - 32

← 1 2 3 4 5 →