Computing the Clique-width of Cactus Graphs

被引：1
|
作者：
Leonardo Gonzalez-Ruiz, J. [1 ]
Raymundo Marcial-Romero, J. [1 ]
Hernandez-Servin, J. A. [1 ]
机构：
[1] Univ Autonoma Estado Mexico, Fac Ingn, Toluca, Mexico
来源：
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2016年 / 328卷 / 328期
关键词：
Graph theory; Clique-width; Tree-width; Complexity;
D O I：
10.1016/j.entcs.2016.11.005
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Similar to the tree-width (twd), the clique-width (cwd) is an invariant of graphs. A well known relationship between tree-width and clique-width is that cwd(G) <= 3. 2(twd(G)) (1. I)t is also known that tree-width of Cactus graphs is 2, therefore the clique-width for those graphs is smaller or equal than 6. In this paper, it is shown that the clique-width of Cactus graphs is smaller or equal to 4 and we present a polynomial time algorithm which computes exactly a 4-expression.
引用
收藏
页码：47 / 57
页数：11
相关论文
共 50 条
  • [41] Constrained-Path Labellings on Graphs of Bounded Clique-Width
    Courcelle, Bruno
    Twigg, Andrew
    THEORY OF COMPUTING SYSTEMS, 2010, 47 (02) : 531 - 567
  • [42] Infinitely many minimal classes of graphs of unbounded clique-width
    Collins, A.
    Foniok, J.
    Korpelainen, N.
    Lozin, V.
    Zamaraev, V.
    DISCRETE APPLIED MATHEMATICS, 2018, 248 : 145 - 152
  • [43] Constrained-Path Labellings on Graphs of Bounded Clique-Width
    Bruno Courcelle
    Andrew Twigg
    Theory of Computing Systems, 2010, 47 : 531 - 567
  • [44] Clique-width of graphs defined by one-vertex extensions
    Rao, Michael
    DISCRETE MATHEMATICS, 2008, 308 (24) : 6157 - 6165
  • [45] Classifying the clique-width of H-free bipartite graphs
    Dabrowski, Konrad K.
    Paulusma, Daniel
    DISCRETE APPLIED MATHEMATICS, 2016, 200 : 43 - 51
  • [46] NCE graph grammars and clique-width
    Glikson, A
    Makowsky, JA
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2003, 2880 : 237 - 248
  • [47] Bounding the clique-width of H-free split graphs
    Brandstaedt, Andreas
    Dabrowski, Konrad K.
    Huan, Shenwei
    Paulusma, Daniel
    DISCRETE APPLIED MATHEMATICS, 2016, 211 : 30 - 39
  • [48] Edge dominating set and colorings on graphs with fixed clique-width
    Kobler, D
    Rotics, U
    DISCRETE APPLIED MATHEMATICS, 2003, 126 (2-3) : 197 - 221
  • [49] A FRAMEWORK FOR MINIMAL HEREDITARY CLASSES OF GRAPHS OF UNBOUNDED CLIQUE-WIDTH
    Brignall, R.
    Cocks, D.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (04) : 2558 - 2584
  • [50] Bounding the Clique-Width of H-Free Chordal Graphs
    Brandstaedt, Andreas
    Dabrowski, Konrad K.
    Huang, Shenwei
    Paulusma, Daniel
    JOURNAL OF GRAPH THEORY, 2017, 86 (01) : 42 - 77
12345