Linear Clique-Width for Hereditary Classes of Cographs

  title={Linear Clique-Width for Hereditary Classes of Cographs},
  author={Robert Brignall and Nicholas Korpelainen and Vincent Vatter},
  journal={J. Graph Theory},
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. 

Topics from this paper

Linear Clique-Width of Bi-complement Reducible Graphs
We prove that in the class of bi-complement reducible graphs linear clique-width is unbounded and show that this class contains exactly two minimal hereditary subclasses of unbounded linearExpand
Between clique-width and linear clique-width of bipartite graphs
It is conjectured that a hereditary class of bipartite graphs of bounded clique-width that excludes a graph from each of the four critical classes has bounded linear cliques-width. Expand
Clique-Width for Hereditary Graph Classes
A possible strong connection between results on boundedness of clique-width and on well-quasi-orderability by the induced subgraph relation for hereditary graph classes is explained. Expand
Infinitely many minimal classes of graphs of unbounded clique-width
It is proved that the family of minor-closed graph classes of graphs of unbounded clique-width is infinite, and it is shown that the same is true with respect to linear cliques-width. Expand
The Micro-world of Cographs
This paper identifies several milestones in the world of cographs and creates a hierarchy of graph parameters grounded on these milestones, which helps to discover a complex world, where many parameters jump from finiteness to infinity. Expand
Tree pivot-minors and linear rank-width
It is shown that for every tree T there exists a constant cT such that every graph of path-width at least cT contains T as a minor, which is false if T is not a caterpillar, but true if T is the claw. Expand
Critical Properties and Complexity Measures of Read-Once Boolean Functions
In this paper, we define a quasi-order on the set of read-once Boolean functions and show that this is a well-quasi-order. This implies that every parameter measuring complexity of the functions canExpand
Combinatorial Algorithms: 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings
This paper presents a meta-modelling architecture suitable for large-scale distributed Optimization Via Population Protocols and some examples show how this architecture can be implemented in the rapidly changing environment. Expand
The micro-world of cographs


Minimal Classes of Graphs of Unbounded Clique-Width
The first two minimal with respect to set-inclusion hereditary classes of graphs of unbounded clique-width: Bipartite permutation graphs and unit interval graphs are identified. Expand
Recent developments on graphs of bounded clique-width
This paper provides a survey of recent results addressing the clique-width of graphs in a certain class of graphs and shows that for many classes of graphs, this parameter has been proved to be unbounded. Expand
Induced subgraphs and well-quasi-ordering
  • P. Damaschke
  • Mathematics, Computer Science
  • J. Graph Theory
  • 1990
The main result shows that the class of cographs (P4-free graphs) is WQO by ≤i, and that this is the unique maximal lower ideal with one forbidden subgraph that is W QO. Expand
Upper bounds to the clique width of graphs
Clique width is bound in terms of its tree width on the one hand, and of the clique width of its edge complement on the other, to reduce the complexity measure of graphs associated with hierarchical decompositions. Expand
Graphs of Linear Clique-Width at Most 3
The first characterisation of graphs of linear cliquewidth at most 3 is given, and a polynomial-time recognition algorithm for such graphs is given. Expand
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width
It is proved that this is also the case for graphs of clique-width at most k, where this complexity measure is associated with hierarchical decompositions of another type, and where logical formulas are no longer allowed to use edge set quantifications. Expand
A Complete Characterisation of the Linear Clique-Width of Path Powers
It is shown that k -path powers above a certain size have linear clique-width exactly k + 2, providing the first complete characterisation of the linear cliques-width of a graph class of unbounded clique -width. Expand
On the Relationship between Clique-Width and Treewidth
There is an exponential lower bound on the relationship between treewidth and clique-width and it is shown that there is a polynomial time algorithm for any graph problem expressible in Monadic Second Order Logic. Expand
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time
We show that many non-MSO1 NP-hard graph problems can be solved in polynomial time on clique-width and NLC-width bounded graphs using a very general and simple scheme. Our examples are partition intoExpand
Graph Classes: A Survey
Preface 1. Basic Concepts 2. Perfection, Generalized Perfection, and Related Concepts 3. Cycles, Chords and Bridges 4. Models and Interactions 5. Vertex and Edge Orderings 6. Posets 7. ForbiddenExpand