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 条
  • [11] Unique intersectability of diamond-free graphs
    Guo, Jun-Lin
    Wang, Tao-Ming
    Wang, Yue-Li
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (08) : 774 - 778
  • [12] ON A FAMILY OF DIAMOND-FREE STRONGLY REGULAR GRAPHS
    Mohammadian, A.
    Tayfeh-Rezaie, B.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014, 28 (04) : 1906 - 1915
  • [13] Diamond-free circle graphs are Helly circle
    Daligault, Jean
    Goncalves, Daniel
    Rao, Michael
    DISCRETE MATHEMATICS, 2010, 310 (04) : 845 - 849
  • [14] On Total Domination and Hop Domination in Diamond-Free Graphs
    Chen, Xue-gang
    Wang, Yu-feng
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2020, 43 (02) : 1885 - 1891
  • [15] On Total Domination and Hop Domination in Diamond-Free Graphs
    Xue-gang Chen
    Yu-feng Wang
    Bulletin of the Malaysian Mathematical Sciences Society, 2020, 43 : 1885 - 1891
  • [16] A proof of Hougardy's conjecture for diamond-free graphs
    Kézdy, AE
    Scobee, M
    DISCRETE MATHEMATICS, 2001, 240 (1-3) : 83 - 95
  • [17] On probe 2-clique graphs and probe diamond-free graphs
    Bonomo, Flavia
    de Figueiredo, Celina M. H.
    Duran, Guillermo
    Grippo, Luciano N.
    Safe, Martin D.
    Szwarcfiter, Jayme L.
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2015, 17 (01): : 187 - 200
  • [18] MINIMALLY UNBALANCED DIAMOND-FREE GRAPHS AND DYCK-PATHS
    Apollonio, Nicola
    Galluccio, Anna
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2015, 29 (04) : 1837 - 1863
  • [19] Maximal local edge-connectivity of diamond-free graphs
    Holtkamp, Andreas
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2011, 49 : 153 - 158
  • [20] The Diamond-Free Process
    Picollelli, Michael E.
    RANDOM STRUCTURES & ALGORITHMS, 2014, 45 (03) : 513 - 551
12345