Recognition algorithm for diamond-free graphs

被引:0
|
作者
Talmaciu, Mihai [1 ]
Nechita, Elena [1 ]
机构
[1] Univ Bacau, Dept Math & Informat, Bacau 600114, Romania
关键词
diamond graph; weakly decomposition; recognition algorithm;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we recall the notion of weakly decomposition, we recall some necessary and sufficient conditions for a graph to admit such a decomposition, we introduce the recognition algorithm for the diamond-free graphs which keeps the combinatorial structure of the graph by means of the decomposition, as well as an easy possibility to determine the clique number for the diamond-free graphs.
引用
收藏
页码:457 / 462
页数:6
相关论文
共 50 条