Well-quasi-ordering Does Not Imply Bounded Clique-width

被引：5
|
作者：
Lozin, Vadim V. [1 ]
Razgon, Igor [2 ]
Zamaraev, Viktor [3 ]
机构：
[1] Univ Warwick, Math Inst, Coventry CV4 7AL, W Midlands, England
[2] Univ London, Dept Comp Sci & Informat Syst, Birkbeck, London, England
[3] Univ Warwick, Math Inst, Coventry CV4 7AL, W Midlands, England
来源：
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE | 2016年 / 9224卷
基金：
英国工程与自然科学研究理事会;
关键词：
INDUCED SUBGRAPHS; GRAPHS;
D O I：
10.1007/978-3-662-53174-7_25
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present a hereditary class of graphs of unbounded clique-width which is well-quasi-ordered by the induced subgraph relation. This result provides the negative answer to a question asked by Daligault, Rao and Thomasse in [3].
引用
收藏
页码：351 / 359
页数：9
相关论文
共 50 条
  • [21] WELL-QUASI-ORDERING SEQUENCES
    LAVER, R
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1971, 18 (05): : 841 - &
  • [22] Deciding clique-width for graphs of bounded tree-width
    Espelage, W
    Gurski, F
    Wanke, E
    ALGORITHMS AND DATA STRUCTURES, 2001, 2125 : 87 - 98
  • [23] On powers of graphs of bounded NLC-width (clique-width)
    Suchana, Karol
    Todinca, Ioan
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (14) : 1885 - 1893
  • [24] Vertex disjoint paths on clique-width bounded graphs
    Gurski, Frank
    Wanke, Egon
    THEORETICAL COMPUTER SCIENCE, 2006, 359 (1-3) : 188 - 199
  • [25] SUBGRAPHS AND WELL-QUASI-ORDERING
    DING, GL
    JOURNAL OF GRAPH THEORY, 1992, 16 (05) : 489 - 502
  • [26] 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
  • [27] Graph classes with and without powers of bounded clique-width
    Bonomo, Flavia
    Grippo, Luciano N.
    Milanic, Martin
    Safe, Martin D.
    DISCRETE APPLIED MATHEMATICS, 2016, 199 : 3 - 15
  • [28] Succinct data structures for bounded clique-width graphs
    Chakraborty, Sankardeep
    Jo, Seungbum
    Sadakane, Kunihiko
    Satti, Srinivasa Rao
    DISCRETE APPLIED MATHEMATICS, 2024, 352 : 55 - 68
  • [29] 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
  • [30] 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
12345