Bounding clique-width via perfect graphs

作者：

Highlights：

• We present a new technique for proving boundedness of clique-width.

• We give three conditions for diamond-free graphs to have bounded clique-width.

• We present a new class of diamond-free graphs of unbounded clique-width.

摘要

•We present a new technique for proving boundedness of clique-width.•We give three conditions for diamond-free graphs to have bounded clique-width.•We present a new class of diamond-free graphs of unbounded clique-width.

论文关键词：Clique-width,Forbidden induced subgraphs,Graph class

论文评审过程：Received 10 June 2015, Revised 16 June 2016, Accepted 24 June 2016, Available online 12 July 2016, Version of Record 6 June 2019.

论文官网地址：https://doi.org/10.1016/j.jcss.2016.06.007