Linear Clique-width for Subclasses of Cographs, with Connections to Permutations
نویسندگان
چکیده
We prove that a hereditary property of cographs has bounded linear cliquewidth 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, and the similarities between these two strands of investigation lead us to a conjecture relating the graph properties of bounded linear clique-width to permutation classes with rational generating functions which would have far-reaching consequences if true.
منابع مشابه
Algorithmic Aspects of Switch Cographs
This paper introduces the notion of involution module, the first generalization of the modular decomposition of 2-structure which has a unique linear-sized decomposition tree. We derive an O(n) decomposition algorithm and we take advantage of the involution modular decomposition tree to state several algorithmic results. Cographs are the graphs that are totally decomposable w.r.t modular decomp...
متن کاملGem- And Co-Gem-Free Graphs Have Bounded Clique-Width
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 concepts of graph decomposition such a...
متن کاملEnumerative aspects of certain subclasses of perfect graphs
We investigate the enumerative aspects of various classes of perfect graphs like cographs, split graphs, trivially perfect graphs and threshold graphs. For subclasses of permutation graphs like cographs and threshold graphs we also determine the number of permutations of f1; 2; : : : ; ng such that the permutation graph G] belongs to that class. We establish an interesting bijec-tion between pe...
متن کاملComputing the Tutte Polynomial on Graphs of Bounded Clique-Width
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. The notion of clique-width extends the definition of cograhs (graphs without induced P4), and it is a more general notion than that of tree-width. We show a subexponential algorithm (running in time exp O(n) ) for compu...
متن کاملFully polynomial FPT algorithms for some classes of bounded clique-width graphs
Parameterized complexity theory has enabled a refined classification of the difficulty of NPhard optimization problems on graphs with respect to key structural properties, and so to a better understanding of their true difficulties. More recently, hardness results for problems in P were achieved using reasonable complexity theoretic assumptions such as: Strong Exponential Time Hypothesis (SETH)...
متن کامل