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 条
  • [1] Computing the Clique-Width of Polygonal Tree Graphs
    Leonardo Gonzalez-Ruiz, J.
    Raymundo Marcial-Romero, J.
    Hernandez, J. A.
    De Ita, Guillermo
    ADVANCES IN SOFT COMPUTING, MICAI 2016, PT II, 2017, 10062 : 449 - 459
  • [2] Between clique-width and linear clique-width of bipartite graphs
    Alecu, Bogdan
    Kante, Mamadou Moustapha
    Lozin, Vadim
    Zamaraev, Viktor
    DISCRETE MATHEMATICS, 2020, 343 (08)
  • [3] Computing graph polynomials on graphs of bounded clique-width
    Makowsky, J. A.
    Rotics, Udi
    Averbouch, Ilya
    Godlin, Benny
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2006, 4271 : 191 - 204
  • [4] Computing the Clique-Width on Series-Parallel Graphs
    Antonio Lopez-Medina, Marco
    Leonardo Gonzalez-Ruiz, J.
    Raymundo Marcial-Romero, J.
    Hernandez, J. A.
    COMPUTACION Y SISTEMAS, 2022, 26 (02): : 815 - 822
  • [5] Computing the Tutte polynomial on graphs of bounded clique-width
    Giménez, O
    Hlineny, P
    Noy, M
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2005, 3787 : 59 - 68
  • [6] Computing the tutte polynomial on graphs of bounded clique-width
    Gimenez, Omer
    Hlineny, Petr
    Noy, Marc
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2006, 20 (04) : 932 - 946
  • [7] Bipartite Graphs of Large Clique-Width
    Korpelainen, Nicholas
    Lozin, Vadim V.
    COMBINATORIAL ALGORITHMS, 2009, 5874 : 385 - +
  • [8] On the clique-width of graphs in hereditary classes
    Boliac, R
    Lozin, V
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 44 - 54
  • [9] Alliances in graphs of bounded clique-width
    Otachi, Yota (otachi@jaist.ac.jp), 2017, Elsevier B.V., Netherlands (223)
  • [10] Graphs of linear clique-width at most
    Heggernes, Pinar
    Meister, Daniel
    Papadopoulos, Charis
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2008, 4978 : 330 - 341
12345