Chordal co-gem-free and ( [formula omitted],gem)-free graphs have bounded clique-width

Abstract

It is well known that the clique-width of chordal gem-free graphs (also known as ptolemaic graphs), as a subclass of distance-hereditary graphs, is at most 3. Hereby, the gem consists of a P 4 plus a vertex being completely adjacent to the P 4 , and the co-gem is its complement graph. On the other hand, unit interval graphs being another important subclass of chordal graphs, have unbounded clique-width. In this note, we show that, based on certain tree structure and module properties, chordal co-gem-free graphs have clique-width at most eight. By a structure result for ( P 5 ,gem)-free graphs, this implies bounded clique-width for this class as well. Moreover, known results on unbounded clique-width of certain grids and of split graphs imply that the gem and the co-gem are the only one-vertex P 4 extension H such that chordal H-free graphs have bounded clique-width.