DOMINATING CLIQUES IN CHORDAL GRAPHS

被引：11
|
作者：
KRATSCH, D
DAMASCHKE, P
LUBIW, A
机构：
[1] FRIEDRICH SCHILLER UNIV,FAC MATH,O-6900 JENA,GERMANY
[2] UNIV WATERLOO,DEPT COMP SCI,WATERLOO N2L 3G1,ONTARIO,CANADA
来源：
DISCRETE MATHEMATICS | 1994年 / 128卷 / 1-3期
关键词：
D O I：
10.1016/0012-365X(94)90118-X
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal graph which has a dominating clique has one as small as the smallest dominating set-and, furthermore, there is a linear-time algorithm to find such a small dominating clique.
引用
收藏
页码：269 / 275
页数：7
相关论文
共 50 条
12345