Alliances in graphs of bounded clique-width

被引：0
|
作者：
机构：
[1] Kiyomi, Masashi
[2] Otachi, Yota
来源：
Otachi, Yota (otachi@jaist.ac.jp) | 2017年 / Elsevier B.V., Netherlands卷 / 223期
关键词：
921.4 Combinatorial Mathematics; Includes Graph Theory; Set Theory - 921.6 Numerical Methods;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
30
引用
收藏
相关论文
共 50 条
  • [1] Alliances in graphs of bounded clique-width
    Kiyomi, Masashi
    Otachi, Yota
    DISCRETE APPLIED MATHEMATICS, 2017, 223 : 91 - 97
  • [2] Line graphs of bounded clique-width
    Gurski, Frank
    Wanke, Egon
    DISCRETE MATHEMATICS, 2007, 307 (22) : 2734 - 2754
  • [3] Coloring powers of graphs of bounded clique-width
    Todinca, I
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2003, 2880 : 370 - 382
  • [4] Recent developments on graphs of bounded clique-width
    Kaminski, Marcin
    Lozin, Vadim V.
    Milanic, Martin
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (12) : 2747 - 2761
  • [5] Critical properties of graphs of bounded clique-width
    Lozin, Vadim V.
    Milanic, Martin
    DISCRETE MATHEMATICS, 2013, 313 (09) : 1035 - 1044
  • [6] Vertex disjoint paths on clique-width bounded graphs
    Gurski, Frank
    Wanke, Egon
    THEORETICAL COMPUTER SCIENCE, 2006, 359 (1-3) : 188 - 199
  • [7] Deciding clique-width for graphs of bounded tree-width
    Espelage, W
    Gurski, F
    Wanke, E
    ALGORITHMS AND DATA STRUCTURES, 2001, 2125 : 87 - 98
  • [8] On powers of graphs of bounded NLC-width (clique-width)
    Suchana, Karol
    Todinca, Ioan
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (14) : 1885 - 1893
  • [9] Between clique-width and linear clique-width of bipartite graphs
    Alecu, Bogdan
    Kante, Mamadou Moustapha
    Lozin, Vadim
    Zamaraev, Viktor
    DISCRETE MATHEMATICS, 2020, 343 (08)
  • [10] 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
12345