Recognition algorithm for diamond-free graphs

被引：0
|
作者：
Talmaciu, Mihai [1 ]
Nechita, Elena [1 ]
机构：
[1] Univ Bacau, Dept Math & Informat, Bacau 600114, Romania
来源：
INFORMATICA | 2007年 / 18卷 / 03期
关键词：
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 条
  • [1] On the connectivity of diamond-free graphs
    Dankelmann, Peter
    Hellwig, Angelika
    Volkmann, Lutz
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (16) : 2111 - 2117
  • [2] Colouring diamond-free graphs
    Dabrowski, Konrad K.
    Dross, Francois
    Paulusma, Daniel
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 89 : 410 - 431
  • [3] A new approximate cluster deletion algorithm for diamond-free graphs
    Sabrine Malek
    Wady Naanaa
    Journal of Combinatorial Optimization, 2020, 39 : 385 - 411
  • [4] A new approximate cluster deletion algorithm for diamond-free graphs
    Malek, Sabrine
    Naanaa, Wady
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 39 (02) : 385 - 411
  • [5] Perfectly contractile diamond-free graphs
    Rusu, I
    JOURNAL OF GRAPH THEORY, 1999, 32 (04) : 359 - 389
  • [6] On the Competition Numbers of Diamond-Free Graphs
    Sano, Yoshio
    DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 2016, 9943 : 247 - 252
  • [7] Strong cliques in diamond-free graphs
    Chiarelli, Nina
    Martinez-Barona, Berenice
    Milanic, Martin
    Monnot, Jerome
    Mursic, Peter
    THEORETICAL COMPUTER SCIENCE, 2021, 858 : 49 - 63
  • [8] Strong Cliques in Diamond-Free Graphs
    Chiarelli, Nina
    Martinez-Barona, Berenice
    Milanic, Martin
    Monnot, Jerome
    Mursic, Peter
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2020, 2020, 12301 : 261 - 273
  • [9] Perfectly contractile diamond-free graphs
    Universitá d'Orláans, L.I.F.O., B.P. 6759, 45067 Orláans Cedex 2, France
    J. Graph Theory, 4 (359-389):
  • [10] On weakly diamond-free Berge graphs
    Haddadene, HA
    Gravier, S
    DISCRETE MATHEMATICS, 1996, 159 (1-3) : 237 - 240
12345