Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width

Abstract

The P4 is the induced path of four vertices. The gem consists of a P4 with an additional universal vertex being completely adjacent to the P4, and the co-gem is its complement graph. Gemand co-gem-free graphs generalize the popular class of cographs (i. e. P4-free graphs). The tree structure and algebraic generation of cographs has been crucial for several… (More)
DOI: 10.1142/S0129054104002364

Topics

6 Figures and Tables

Cite this paper

@article{Brandstdt2004GemAC, title={Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width}, author={Andreas Brandst{\"a}dt and Ho{\`a}ng-Oanh Le and Raffaele Mosca}, journal={Int. J. Found. Comput. Sci.}, year={2004}, volume={15}, pages={163-185} }