---
title: 'Strongly Chordal Digraphs: Orderability & Algorithms'
url: https://www.emergentmind.com/topics/strongly-chordal-digraphs
type: topic
---

# Strongly Chordal Digraphs: Orderability & Algorithms

Strongly chordal digraphs are digraphs whose adjacency matrices admit a symmetric \(\Gamma\)-free ordering, where
\[
\Gamma=\begin{bmatrix}1&1\\[2pt]1&0\end{bmatrix}.
\]
Equivalently, they are digraphs that admit a strong ordering of the vertex set. The notion was introduced as a common framework extending strongly chordal graphs and chordal bipartite graphs, while remaining strictly inside a broader chordal-digraph landscape. Its modern development is driven by matrix orderability, elimination orderings, obstruction sets, and specialized recognition algorithms; by contrast, general recognition for arbitrary digraphs with possible loops remains open [1909.03597] [2509.18541].

## 1. Definition and matrix formulation

The defining property is a simultaneous row-and-column ordering of the adjacency matrix. For a square \(0,1\)-matrix \(M\), a symmetric \(\Gamma\)-free ordering means that the same permutation is applied to rows and columns and the resulting matrix contains no submatrix equal to \(\Gamma\). A digraph \(D\) is strongly chordal exactly when its adjacency matrix \(M(D)\) has such an ordering [1909.03597].

This matrix condition has a purely combinatorial reformulation. An ordering \(v_1,\dots,v_n\) of \(V(D)\) is a strong ordering if, for all \(i<j\) and \(k<\ell\),
\[
v_i v_k\in E(D),\quad v_i v_\ell\in E(D),\quad v_j v_k\in E(D)
\implies v_j v_\ell\in E(D).
\]
A digraph is strongly chordal if and only if it has a strong ordering. In the later formulation of the theory, the same condition is expressed with arc notation:
\[
(v_i,v_k),\ (v_i,v_\ell),\ (v_j,v_k)\in A(D)\implies (v_j,v_\ell)\in A(D).
\]
This ordering criterion is the direct digraph analogue of the strong ordering characterization of undirected strongly chordal graphs [2509.18541].

The matrix perspective is not merely a reformulation. It identifies strong chordality with a global orderability constraint rather than with a local cycle prohibition. The defining feature is the global nesting of neighborhoods forced by the forbidden \(\Gamma\) pattern under a single row/column order. This is substantially stronger than allowing independent row and column permutations, which leads instead to the classical notion of total balance [1909.03597].

## 2. Relation to classical graph classes and to chordal digraphs

Strongly chordal digraphs were introduced to unify two classical classes. First, if the digraph is symmetric and reflexive, then the digraph notion reduces to the usual notion of a strongly chordal graph: a reflexive graph is strongly chordal exactly when its adjacency matrix has a symmetric \(\Gamma\)-free ordering. Second, chordal bipartite graphs also fit the framework, because the symmetric \(\Gamma\)-free ordering condition on the digraph adjacency matrix specializes to the usual \(\Gamma\)-free ordering of the biadjacency matrix in the bipartite setting [1909.03597] [2509.18541].

Within directed graph theory, strong chordality sits inside a larger class of chordal digraphs. In the framework of the foundational paper, a digraph is chordal if it has a simplicial ordering, where a vertex \(v\) is simplicial if for every \(u\in N^-(v)\) and \(w\in N^+(v)\), the arc \(uw\) is present. A strong ordering is stricter than a simplicial ordering, and indeed every strong ordering is a simple ordering, every simple ordering is a simplicial ordering, and therefore every strongly chordal digraph is chordal [1909.03597].

The converse fails. Strong chordality is more restrictive because it excludes the \(\Gamma\) pattern globally, not only at the current elimination vertex. This difference is visible already in tournaments: simple orderings and strong orderings do not coincide for general digraphs or tournaments [1909.03597].

A separate terminological issue arises because another line of work uses “chordal directed graph” for a digraph with no induced directed cycle of length at least \(4\). That cycle-based condition is much weaker. In particular, there exist digraphs with no \(TT_3\) and no induced directed cycle of length at least \(4\) whose dichromatic number is arbitrarily large, so this broader class is not \(\chi\)-bounded [2202.01006]. This shows that strong chordality cannot be reduced to the prohibition of long induced directed cycles.

## 3. Structural properties, simple vertices, and obstruction theory

Several structural lemmas organize the subject. A vertex \(v\) is simplicial if either it is irreflexive, or for all \(u\in N^-(v)\) and \(w\in N^+(v)\), one has \((u,w)\in A(D)\). A vertex is simple if it is simplicial and additionally the out-neighborhoods of any two in-neighbors are comparable by inclusion, while the in-neighborhoods of any two out-neighbors are comparable by inclusion. A simple ordering is one in which each vertex is simple in the remaining induced subdigraph. If no vertex of a digraph is simple, then the digraph is not strongly chordal [2509.18541].

The theory also isolates local obstructions. In an irreflexive digraph, a peak is a vertex \(v\) for which there exist \(u,w\) such that \(u\to v\), \(v\to w\), and \(u\to w\). A peak cannot be the last vertex of a simple ordering; hence, if every vertex is a peak, the digraph is not strongly chordal. Another matrix-theoretic constraint is that if a digraph has a simple ordering, then its adjacency matrix is totally balanced, but the converse fails in general, even among irreflexive tournaments [2509.18541].

The symmetric case yields the fullest general characterization. For a graph with possible loops, the following are equivalent: the graph is strongly chordal; its adjacency matrix is totally balanced; every induced subgraph has a simple vertex; and the graph has a simple ordering. This extends Farber’s theorem from reflexive strongly chordal graphs to graphs with possible loops [1909.03597].

That symmetric theory admits both walk and obstruction descriptions. A graph with possible loops is strongly chordal if and only if every even closed walk of length at least \(6\) has a strong chord. Equivalently, it is strongly chordal if and only if it avoids the nine families \({\cal F}_1,\dots,{\cal F}_9\), consisting of reflexive cycles of length at least \(4\), irreflexive cycles of length other than \(4\), several looped cycle-and-fan configurations, weak trampolines, and paths of length at least \(2\) whose endpoints are both reflexive [1909.03597].

## 4. Exact classifications in major subclasses

Later work develops complete descriptions for several important subclasses of digraphs with possible loops [2509.18541].

| Class | Exact characterization | Recognition |
|---|---|---|
| Irreflexive tournaments | Obtained from a transitive tournament by reversing at most one arc; equivalently \(\mathcal T\)-free | \(O(|V|+|A|)\), certifying |
| Tournaments with possible loops | Obtained from a transitive tournament by reversing at most one arc with at least one irreflexive endvertex; equivalently \(\mathcal T^\circ\)-free | \(O(|V|+|A|)\), certifying |
| Reflexive multipartite tournaments | \(\mathcal F_r\)-free transitive orientations of complete split graphs | \(O(|V|+|A|)\), certifying |
| Irreflexive bipartite tournaments | \(\{B_1,B_2,B_3,B_4\}\)-free; equivalently one one-way bigraph has at most two nontrivial bipartite-chain components | \(O(|V|+|A|)\) |
| Balanced digraphs | Strongly chordal iff each layer \(G_i\) is a chordal bigraph; equivalently fence-free | Polynomial-time; linear-time in the later treatment |

For irreflexive tournaments, the structure is especially rigid. Such a tournament is strongly chordal if and only if it is obtained from a transitive tournament by reversing at most one arc; equivalently, it does not contain two arc-disjoint directed triangles; equivalently, it is \(\mathcal T\)-free, where \(\mathcal T=\{T_1,\dots,T_6\}\) is the family of six minimal forbidden induced subdigraphs. In the strongly connected case, the only possibility is \(TT_n^\ast\), obtained from the transitive tournament \(TT_n\) by reversing the arc from the unique source to the unique sink [2509.18541].

For tournaments with possible loops, the class is again close to transitivity. A tournament with possible loops is strongly chordal if and only if it is obtained from a transitive tournament by reversing at most one arc with at least one irreflexive endvertex; equivalently, it is \(\mathcal T^\circ\)-free; equivalently, it is \(T_0\)-free, its irreflexive part is strongly chordal, and its reflexive vertices induce a transitive tournament [2509.18541].

Reflexive multipartite tournaments satisfy an even sharper global constraint. If such a digraph is strongly chordal, then its underlying graph is a complete split graph \(V(D)=T\cup S\), where \(T\) induces a transitive tournament, \(S\) is an independent set, and every vertex in \(S\) is adjacent to every vertex in \(T\). The vertices of \(S\) can be assigned levels according to the number of in-neighbors in \(T\), and the main theorem states that all vertices in \(S\), except possibly one, lie in two consecutive levels [2509.18541].

Balanced digraphs are the class where the definition becomes most transparent. A balanced digraph is an irreflexive digraph in which every cycle has the same number of forward and backward arcs; equivalently, the vertex set can be partitioned into \(V_1,\dots,V_k\) so that every arc goes from \(V_i\) to \(V_{i+1}\). If \(G_i\) denotes the underlying bipartite graph between \(V_i\) and \(V_{i+1}\), then the digraph is strongly chordal if and only if each \(G_i\) is a chordal bigraph. Equivalently, a balanced digraph is strongly chordal exactly when it contains no induced fence, where a fence is an oriented even cycle of length greater than \(4\) with no directed path of length \(2\). An immediate corollary is that every oriented tree is strongly chordal [1909.03597] [2509.18541].

## 5. Recognition algorithms and domination theory

Recognition is polynomial in several important settings, but not in full generality. The foundational study established polynomial-time recognition for symmetric digraphs, tournaments with possible loops, and balanced digraphs, together with forbidden induced subgraph characterizations in each of these cases [1909.03597]. Later work extended this program to additional families and supplied \(O(|V|+|A|)\)-time certifying algorithms for irreflexive tournaments, tournaments with possible loops, reflexive multipartite tournaments, and several related classes [2509.18541].

The algorithmic viewpoint is inseparable from the ordering viewpoint. In the symmetric case, the equivalence between strong chordality, total balance, simple vertices in every induced subgraph, and simple orderings gives a direct elimination-based recognition mechanism. In tournaments and multipartite tournaments, recognition uses strong components, degree-sequence tests, explicit obstruction families, and constructive production of a \(\Gamma\)-free ordering when the input belongs to the class [1909.03597] [2509.18541].

A second major algorithmic theme is domination. For strongly chordal graphs with possible loops, a linear-time algorithm computes a minimum general dominating set when a strong ordering is available. The algorithm maintains a set \(C\) of vertices with pairwise disjoint neighborhoods, a set \(D\) of chosen dominators, and a temporary label \(N\): repeatedly one chooses the first vertex \(x\) not labeled \(N\), lets \(y\) be the last neighbor of \(x\), labels \(x\) with \(C\), labels \(y\) with \(D\), and labels all neighbors of \(y\) with \(N\). The invariants \(|C|=|D|\) and pairwise disjointness of neighborhoods of vertices in \(C\) imply optimality. This extends and unifies Farber’s algorithm for minimum dominating set in reflexive strongly chordal graphs and the Damaschke–Mueller–Kratsch algorithm for minimum total dominating set in chordal bipartite graphs [1909.03597].

For strongly chordal digraphs, later work proves a min–max theorem of the same flavor. The paper states that in a strongly chordal digraph the minimum size of a total dominating set equals the maximum number of disjoint in-neighborhoods, and this number can be calculated in linear time given a \(\Gamma\)-free ordering. In the detailed development, domination is formulated so that a looped vertex may dominate itself while a loopless vertex cannot, thereby unifying domination and total domination. The greedy procedure again relies on a strong ordering: select the first unlabeled vertex \(x\), choose the last in-neighbor \(y\) of \(x\), label \(x\) by \(C\), \(y\) by \(D\), and all out-neighbors of \(y\) by \(N\). The correctness argument is that two \(C\)-vertices cannot have intersecting in-neighborhoods without creating a forbidden \(\Gamma\)-submatrix [2509.18541].

## 6. Related notions, limitations, and adjacent developments

Strongly chordal digraphs are closely related to, but distinct from, several neighboring notions. One of these is the class of strict chordal digraphs studied by Hell and Hernández-Cruz. A later signed-graph translation states that strict chordal digraphs are exactly the digraphs whose associated signed graphs are chordal, where a symmetric arc pair becomes a positive edge and a non-symmetric arc adjacency becomes a negative edge. This yields a different but structurally parallel framework based on signed simplicial vertices, signed simplicial edges, separator structure, and lollipop decompositions [2512.14886].

Another neighboring notion is the cycle-based “chordal directed graph” condition. In that setting, a digraph is chordal directed when it has no induced directed cycle of length at least \(4\). The negative dichromatic result shows that even the class
\[
\mathcal C_3=\{D:\ D\text{ has no }TT_3\text{ and no induced directed cycle of length }\ge 4\}
\]
has unbounded dichromatic number: for every \(k\), there exists \(G\in\mathcal C_3\) with \(\chi(G)\ge k\). A plausible implication is that strong chordality should be understood primarily as a matrix-orderability property rather than as a mere strengthening of directed cycle restrictions [2202.01006].

There is also a broader algorithmic chordality literature that does not directly concern strongly chordal digraphs. For example, the Edmonds–Giles conjecture on packing dijoins has been proved for weighted digraphs whose underlying undirected graph is chordal, together with a strongly polynomial-time construction. That work does not state a theorem for strongly chordal digraphs, but it indicates that ordinary chordality of the underlying graph already supports strong min–max structure in some directed optimization problems [2501.10918].

The main open direction emphasized in the strong-chordality literature is general recognition. The foundational paper states that in general it is not clear whether strongly chordal digraphs can be recognized in polynomial time, and the later survey of specialized classes again leaves open the general recognition problem for arbitrary digraphs with possible loops [1909.03597] [2509.18541]. At present, the theory is therefore most complete in structured families—symmetric graphs with loops, tournaments, multipartite tournaments, balanced digraphs, and closely related classes—where strong orderings, obstruction sets, and elimination arguments can be made explicit.

Source: https://www.emergentmind.com/topics/strongly-chordal-digraphs