On the structure of (image,gem)-free graphs Original Research Article

We give a complete structure description of (image,gem)-free graphs. By the results of a related paper, this implies bounded clique width for this graph class. Hereby, as usual, the image is the induced path with five vertices image and four edges image, and the gem consists of a image image with edges image plus a universal vertex e adjacent to image.