2000 character limit reached
Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width
Published 10 Jun 2013 in cs.DM and math.CO | (1306.2114v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper.