Linear Clique-Width for Hereditary Classes of Cographs
Combinatorics
2016-01-26 v5
Abstract
The class of cographs is known to have unbounded linear clique-width. We prove that a hereditary class of cographs has bounded linear clique-width if and only if it does not contain all quasi-threshold graphs or their complements. The proof borrows ideas from the enumeration of permutation classes.
Keywords
Cite
@article{arxiv.1305.0636,
title = {Linear Clique-Width for Hereditary Classes of Cographs},
author = {Robert Brignall and Nicholas Korpelainen and Vincent Vatter},
journal= {arXiv preprint arXiv:1305.0636},
year = {2016}
}
Comments
10 pages. Accepted for J. Graph Theory