Graph classes with and without powers of bounded clique-width
arXiv:1402.2135 · doi:10.1016/j.dam.2015.06.010
Abstract
We initiate the study of graph classes of power-bounded clique-width, that is, graph classes for which there exist integers and such that the -th powers of the graphs are of clique-width at most . We give sufficient and necessary conditions for this property. As our main results, we characterize graph classes of power-bounded clique-width within classes defined by either one forbidden induced subgraph, or by two connected forbidden induced subgraphs. We also show that for every positive integer , there exists a graph class such that the -th powers of graphs in the class form a class of bounded clique-width, while this is not the case for any smaller power.
23 pages, 4 figures