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 条
12345