---
title: 'Linear Clique-Width: Structure and Obstructions'
url: https://www.emergentmind.com/topics/linear-clique-width
type: topic
---

# Linear Clique-Width: Structure and Obstructions

Linear clique-width is a graph width parameter measuring the complexity of building a graph in a strictly sequential fashion using a finite palette of labels and a fixed repertoire of label-based operations. It is a linearized version of clique-width: the underlying construction remains label-based, but the parse tree is constrained to be path-like, so vertices are introduced one-by-one rather than by combining two previously built subgraphs. Across hereditary graph classes, the parameter sits at the intersection of modular decomposition, obstruction theory, logical transductions, and algorithmic metatheorems. Recent work gives a sharp lifting theorem through modular decomposition, identifies quasi-threshold graphs and their complements as the canonical hereditary obstructions to lifting boundedness from prime graphs, and places unbounded linear clique-width at a precise threshold in the CMSO transduction hierarchy [2602.22089] [2501.17556].

## 1. Definitions, formalisms, and basic inequalities

Fix $k \in \mathbb{N}$ and a label set $[k] = \{1,2,\dots,k\}$. A $k$-expression builds a labeled graph by repeatedly applying single-vertex creation, disjoint union $G \oplus H$, edge insertion $\eta_{i,j}$ for $i \neq j$, and relabeling $\rho_{i\to j}$ for $i \neq j$. A graph $G$ has clique-width at most $k$ if it can be constructed by a $k$-expression, and
$$
\mathrm{cw}(G)=\min\{k : G \text{ admits a } k\text{-expression}\}.
$$
Linear clique-width restricts this construction to be sequential: vertices are introduced one-by-one, and there is no binary $\oplus$ combining two previously built graphs. Equivalently, one uses a linear $k$-expression consisting of steps that introduce a new vertex, apply $\eta_{i,j}$, or apply $\rho_{i\to j}$. The linear clique-width is
$$
\mathrm{lcw}(G)=\min\{k : G \text{ admits a linear } k\text{-expression}\}.
$$
These equivalent formalisms appear both in the standard expression language and in algebraic presentations of clique-width [2602.22089] [2501.17556].

The sequential restriction is strict. By design, $\mathrm{lcw}(G)\ge \mathrm{cw}(G)$, and for many classes the inequality is strict. A standard example is the class of cographs: every cograph has $\mathrm{cw}\le 2$, but cographs have unbounded linear clique-width [2602.22089]. A complementary estimate also plays a recurrent role:
$$
\mathrm{lcw}(G)-1 \le \mathrm{lcw}(\overline{G}) \le \mathrm{lcw}(G)+1,
$$
which makes complement-closed obstruction statements particularly natural [1305.0636].

Several technical notions are specific to linear expressions. A label is a **sink** if it is assigned to vertices but never used in subsequent edge insertions or relabelings; sink labels are useful in inflation arguments and in sharp upper bounds for complete or anti-complete modular skeletons [2602.22089]. In algorithmic work on linear expressions, one also tracks **live labels**: a label is live at time $t$ if its current vertices can still participate in a future join. This notion yields state-space reductions in dynamic programming over linear expressions [2606.27159].

## 2. Modular decomposition and the sequential inflation viewpoint

A module in a graph $G$ is a set $M \subseteq V(G)$ such that every vertex outside $M$ is adjacent either to all of $M$ or to none of $M$. The trivial modules are $\emptyset$, singletons, and $V(G)$. A graph on at least two vertices is prime if all of its modules are trivial. Modular decomposition asserts that every graph is uniquely an inflation of a prime skeleton: if $H$ is a graph and $(G_v)_{v\in V(H)}$ is a family of nonempty graphs, then
$$
G = H[\,G_v : v \in V(H)\,]
$$
is obtained by replacing each vertex $v$ of $H$ by $G_v$ and making the bipartite adjacency between $G_u$ and $G_v$ complete if and only if $u$ is adjacent to $v$ in $H$ [2602.22089].

For linear clique-width, this decomposition is structurally decisive. The one-step modular decomposition theorem used in the 2026 lifting result states that every graph $G$ on at least two vertices admits a unique prime graph $H$ on at least two vertices and nonempty graphs $\{G_v : v \in V(H)\}$ such that $G = H[G_v : v \in V(H)]$; when $H$ has at least four vertices, the graphs $G_v$ are also unique. When $G$ or its complement is disconnected, the decomposition is refined so that $H$ is taken to be as large an anti-complete or complete skeleton as possible [2602.22089].

The inflation formalism yields direct linear clique-width bounds. If
$$
G = H[\,G_v : v \in V(H)\,],
$$
then
$$
\mathrm{lcw}(G) \le \mathrm{lcw}(H) + \max_{v\in V(H)} \mathrm{lcw}(G_v).
$$
The construction simulates a linear expression for the skeleton and replaces the insertion of each skeleton vertex by a linear construction of the corresponding module, using a reserved block of labels and then relabeling the module to the skeleton label. When $H$ is complete or anti-complete, the bound improves to
$$
\mathrm{lcw}(G) \le 1 + \max_v \mathrm{lcw}(G_v),
$$
using a sink label to collapse finished modules [2602.22089].

Two further lemmas are central in sequential settings. First, for any vertex $v\in V(G)$, there is a linear expression for $G$ with at most $\mathrm{lcw}(G)+1$ labels that begins by inserting $v$. Second, if $G=H[G_v]$ with $|V(H)|\ge 2$, then either some module already has full complexity, $\mathrm{lcw}(G_x)=\mathrm{lcw}(G)$, or there are distinct modules $G_x,G_y$ with
$$
\mathrm{lcw}(G_x),\mathrm{lcw}(G_y)\ge \mathrm{lcw}(G)-\mathrm{lcw}(H)-1.
$$
These statements enable the induction driving the lifting theorem [2602.22089].

## 3. The lifting theorem and the quasi-threshold obstructions

For clique-width, boundedness lifts cleanly through modular decomposition: a hereditary class has bounded clique-width if and only if its prime members do. For linear clique-width, this lifting property fails in general. The simplest counterexample is the class of cographs: its only prime members are $K_2$ and $\overline{K}_2$, each of linear clique-width at most $2$, yet the class itself has unbounded linear clique-width [2602.22089].

The sharp repair is the main theorem of "Linear clique-width and modular decomposition" [2602.22089]. Let $\mathcal{C}$ be hereditary. Then
$$
\big[ \sup\{\mathrm{lcw}(G): G\in \mathcal{C}\}<\infty \big]
$$
holds if and only if both of the following conditions hold:

1. the prime members of $\mathcal{C}$ have bounded linear clique-width; and  
2. $\mathcal{C}$ contains neither all quasi-threshold graphs nor all complements of quasi-threshold graphs.

A quasi-threshold graph, also called a trivially perfect graph, is defined inductively from $K_1$ by disjoint union and join with $K_1$. Equivalently, quasi-threshold graphs are exactly the $\{P_4,C_4\}$-free graphs. Their complements form the co-quasi-threshold graphs [2602.22089].

The proof uses explicit universal families. Define $Q_1=K_1$, and for $t\ge 2$,
$$
Q_t = (K_1 * Q_{t-1}) \sqcup Q_{t-1}.
$$
Dually, let $\overline{Q}_1=K_1$, and for $s\ge 2$,
$$
\overline{Q}_s = (K_1 \sqcup \overline{Q}_{s-1}) * \overline{Q}_{s-1}.
$$
Every quasi-threshold graph embeds as an induced subgraph of some $Q_t$, and every co-quasi-threshold graph embeds into some $\overline{Q}_s$. Since quasi-threshold graphs and their complements have unbounded linear clique-width, these universal graphs provide canonical obstructions [2602.22089].

The resulting quantitative statement is explicit. Suppose all prime induced subgraphs of $G$ have linear clique-width at most $m$. Proposition 4.1 of the paper states:

> If $\mathrm{lcw}(G) \ge (m+2)(t+s)$, then $G$ contains $Q_t$ or $\overline{Q}_s$ as an induced subgraph.

Contrapositively, if a hereditary class excludes $Q_t$ and $\overline{Q}_s$ and its prime members have $\mathrm{lcw}\le m$, then every graph in the class satisfies
$$
\mathrm{lcw}(G)\le (m+2)(t+s)-1.
$$
Thus one obtains the explicit bound
$$
f(m,t,s)=(m+2)(t+s)-1.
$$
This generalizes the earlier theorem of Brignall, Korpelainen, and Vatter for hereditary classes of cographs, which showed that bounded linear clique-width is equivalent to excluding all quasi-threshold graphs and all complements of quasi-threshold graphs inside the cographs [1305.0636] [2602.22089].

A common misconception is that prime control alone should suffice because it does for clique-width. The modern theorem shows precisely where that intuition fails: quasi-threshold and co-quasi-threshold self-embedding patterns survive modular composition in a way that the strictly sequential formalism cannot absorb [2602.22089].

## 4. Obstruction families, minimal unbounded classes, and finite minimal obstructions

The quasi-threshold families are the canonical obstructions for the modular lifting theorem, but they are not the whole obstruction landscape for linear clique-width. Independent lines of work show that hereditary classes of unbounded linear clique-width admit many minimal forms.

One source is the family $G_a$ built from an infinite graph $P^a$ determined by an infinite word $a$. If $a$ is periodic and contains at least one $1$, then $G_a$ is a minimal hereditary class of graphs of unbounded clique-width and linear clique-width. In particular, the sequence $a(n)=(0^n1)^\omega$ yields infinitely many pairwise incomparable minimal hereditary classes of unbounded clique-width and linear clique-width [1701.08857]. This places linear clique-width in sharp contrast with the tree-width situation, where planar graphs form the unique minimal minor-closed class of unbounded tree-width [1701.08857].

A broader grid framework is developed in "A framework for minimal hereditary classes of graphs of unbounded clique-width" [2203.15446]. Here a hereditary class $\mathcal{G}^{\delta}$ is generated from a triple $\delta=(\alpha,\beta,\gamma)$ controlling consecutive-column edges, bonds between non-consecutive columns, and within-column edges. The parameter $\mathcal{N}^{\delta}$, defined from distinct neighborhoods in a two-row auxiliary graph, characterizes unbounded clique-width:
$$
\mathcal{G}^{\delta}\text{ has unbounded clique-width}\quad\Longleftrightarrow\quad \mathcal{N}^{\delta}\text{ is unbounded.}
$$
For a large family $\Delta_{\min}$ of recurrent triples with bounded bond-complexity parameter $\mathcal{M}^{\beta}$, the corresponding classes are minimal hereditary classes of both unbounded clique-width and unbounded linear clique-width [2203.15446].

The same framework captures several previously known minimal classes, including bipartite permutation graphs, unit interval graphs, bichain graphs, split permutation graphs, and infinite families defined by periodic or recurrent words [2203.15446]. The proofs are constructive: proper hereditary subclasses admit explicit bounded-label linear expressions, with an overall bound of
$$
4k^2+MN+M+2J+2
$$
in the panel construction for subclasses obtained by forbidding a finite $k\times k$ block [2203.15446].

At the level of finite obstructions for fixed bounds, "Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width" identifies explicit families minimal for classes of the form $\{G:\mathrm{lcw}(G)\le k+1\}$ or $\{G:\mathrm{cw}(G)\le k+1\}$ [1306.2114]. Among them are:

- the path-power family $Z_k$, minimal for both bounded clique-width and bounded linear clique-width at level $k+1$;
- the family $S_k$, minimal for bounded linear clique-width, and witnessing strict separation because $\mathrm{cw}(S_k)\le k+1<\mathrm{lcw}(S_k)$ for $k\ge 3$;
- the family $M_{k,1,l}$, minimal obstructions for $\mathrm{lcw}\le k+1$;
- the graphs $M_2^\pm$, minimal obstructions for $\mathrm{lcw}\le 3$ [1306.2114].

These results clarify an important distinction. Quasi-threshold and co-quasi-threshold graphs are the universal hereditary obstructions to *lifting* boundedness from prime graphs, whereas minimal unbounded hereditary classes and minimal forbidden induced subgraphs describe a wider obstruction theory for the parameter itself [2602.22089] [1701.08857] [1306.2114].

## 5. Logical transductions, well-quasi-order, and algorithmic consequences

A major structural development is the dense analogue of the Pathwidth Theorem. If a class of graphs has unbounded linear clique-width, then it can produce all trees via some fixed CMSO transduction [2501.17556]. More precisely, for a class $\mathcal{C}$ of bounded clique-width, either $\mathcal{C}$ has bounded linear clique-width, or there is a surjective MSO transduction from $\mathcal{C}$ onto the class of trees. Combined with the case of unbounded clique-width, this yields the corollary stated in the abstract: if a class has unbounded linear clique-width, then there exists a fixed CMSO transduction producing all trees from the class [2501.17556].

This result positions linear clique-width in the adjacency/CMSO transduction hierarchy:
$$
\mathrm{Trees}_0 < \mathrm{Trees}_1 < \mathrm{Trees}_2 < \cdots < \mathrm{Paths} < \mathrm{Trees} < \mathrm{Graphs}.
$$
Up to and including Trees, the order does not change if one uses MSO rather than CMSO [2501.17556]. In this hierarchy, bounded linear clique-width corresponds to the path-like side, while escaping bounded linearity inside bounded clique-width is already sufficient to CMSO-transduce all trees.

A complementary perspective comes from definability over words. A class of graphs has bounded linear clique-width if and only if it is contained in the image of some MSO-interpretation of finite words [2405.10894]. This connection underlies recent results on induced-subgraph well-quasi-order. For a class $\mathcal{C}$ given as the image of an MSO-interpretation of words, there exists a computable $k$ such that the following are equivalent: $\mathcal{C}$ is $k$-well-quasi-ordered by induced subgraphs, $\mathcal{C}$ is $\infty$-well-quasi-ordered, and $\mathcal{C}$ is labelled-well-quasi-ordered. These properties are decidable [2405.10894]. As a corollary, Pouzet’s second conjecture holds for bounded linear clique-width classes: $\infty$-wqo and labelled-wqo coincide in this regime [2405.10894].

Algorithmically, the sequential nature of linear clique-width permits refined dynamic programs when a linear expression is given. For equitable coloring, there exists an algorithm that, given an integer $k\ge 1$ and an $n$-vertex graph $G$ together with a linear $w$-expression constructing $G$, computes the number of equitable $k$-colorings of $G$ in time
$$
\max\{1,2^k-2\}^w \cdot n^{k+O(1)}.
$$
The improvement over the general clique-width algorithm comes from tracking color-sets only for live labels and excluding both $\emptyset$ and $[k]$ from the state alphabet on live labels [2606.27159]. More generally, the constructive inflation bounds from modular decomposition suggest practical synthesis of linear expressions along modular decomposition trees whenever bounds on prime graphs and excluded universal obstructions are available [2602.22089].

## 6. Related parameters, methodological contrasts, and open directions

Linear clique-width is closely related to, but distinct from, several neighboring width notions. Every graph satisfies $\mathrm{cw}(G)\le \mathrm{lcw}(G)$ [2602.22089]. The transduction-theoretic analysis of unbounded linear clique-width also uses a notion of rank of a set that is functionally related to the parity-matrix rank used in rank-width over $\mathrm{GF}(2)$ [2501.17556]. In the study of minimal hereditary classes, rank-width enters through the inequalities
$$
\mathrm{rw}(G)\le \mathrm{cw}(G)\le 2^{\mathrm{rw}(G)+1}-1,
$$
together with monotonicity of rank-width under vertex-minors [1701.08857]. These connections explain why vertex-minor methods and local complementations appear naturally in lower-bound constructions.

Methodologically, the 2026 modular-decomposition theorem differs sharply from the older cograph proof of Brignall, Korpelainen, and Vatter. The earlier proof followed a blueprint from permutation classes relying on well-quasi-order arguments; the new proof avoids well-quasi-order altogether, using only modular decomposition and the explicit universal graphs $Q_t$ and $\overline{Q}_s$ [1305.0636] [2602.22089]. This suggests a broader role for explicit universal obstruction families in dense width theory.

Several open directions remain. The bound $(m+2)(t+s)$ in the main lifting proposition is linearly tight in $t+s$, since $\mathrm{lcw}(Q_t)$ grows linearly in $t$, but it is likely not optimal; refining constants and sharpening the dependence on $m$ is open [2602.22089]. Further classification of minimal hereditary classes of unbounded linear clique-width, beyond the quasi-threshold universals and the currently known grid- or word-based families, remains active [1701.08857] [2203.15446]. On the logical side, a conjectural vertex-minor analogue asks whether unbounded linear rank-width classes admit all trees as vertex-minors, while another direction asks whether classes of unbounded linear clique-width FO-transduce classes containing subdivisions of all trees [2501.17556]. On the well-quasi-order side, extending the effective MSO-word techniques beyond bounded linear clique-width toward bounded clique-width more generally would require tree-based analogues of the factorization-forest machinery currently available for words [2405.10894].

Taken together, these results place linear clique-width at a precise structural threshold. It is the parameter governing when dense graph constructions remain genuinely path-like, when modular decomposition can be lifted from primes to whole hereditary classes, and when bounded clique-width classes cross from linear discipline into the logical strength required to produce all trees [2602.22089] [2501.17556].

Source: https://www.emergentmind.com/topics/linear-clique-width