Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width
Discrete Mathematics
2014-01-29 v2 Combinatorics
Abstract
In the study of full bubble model graphs of bounded clique-width and bounded linear clique-width, we determined complete sets of forbidden induced subgraphs, that are minimal in the class of full bubble model graphs. In this note, we show that (almost all of) these graphs are minimal in the class of all graphs. As a corollary, we can give sets of minimal forbidden induced subgraphs for graphs of bounded clique-width and for graphs of bounded linear clique-width for arbitrary bounds.
Keywords
Cite
@article{arxiv.1306.2114,
title = {Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width},
author = {Daniel Meister and Udi Rotics},
journal= {arXiv preprint arXiv:1306.2114},
year = {2014}
}