Embeddable Tree-Width: Definitions & Applications

• Embeddable Tree-Width is a graph invariant that measures how effectively a graph can be decomposed into tree-like or low-complexity structures while respecting its embedding.
• It encompasses variants such as embedded-width for plane graphs, spanning decomposition trees, and stochastic embeddings with low distortion, each enforcing specific structural constraints.
• These parameters underpin practical algorithm design, CMSO definability, and approximation schemes for planar, minor-free, and bounded-genus graphs.

Embeddable tree-width is a collection of graph invariants and algorithmic parameters that quantify how the structure of a graph may be faithfully “embedded” or “simulated” within decompositions and host graphs of tree-like or low-complexity structure. Several different notions have been developed: (i) embedded-width (“em-width”) for plane graphs enforcing face-respecting tree decompositions; (ii) embeddable tree-width in the sense of tree-decompositions whose underlying tree is realized as an actual subtree of the graph; and (iii) embeddable tree-width as the minimal width required for stochastic low-distortion embeddings into bounded-treewidth host graphs. All bear a precise relationship to classical tree-width but enforce additional structural or algorithmic constraints. These parameters play a central role in planarity-based structural graph theory, algorithmic metatheorems (notably CMSO tractability), and approximation algorithms for minor-free graph classes.

1. Formal Definitions of Embeddable Tree-Width

Three major variants appear in recent research: embedded-width for plane graphs, embeddable tree-width for tree-verifiable grammars, and embeddable tree-width via stochastic embeddings.

1.1 Embedded-Width (Plane Graphs)

Given a plane graph $G$ (i.e., a planar graph with a fixed crossing-free embedding), an embedded tree decomposition or em-decomposition is a tree-decomposition $(T,\{X_t\})$ satisfying:

1. $\bigcup_{t\in T} X_t = V$,
2. For every edge $\{u,v\}$ there exists $t$ with $u,v\in X_t$,
3. For every $v$, the set $\{t \mid v\in X_t\}$ induces a connected subtree,
4. For every bounded face $f$, there exists $t$ with $(T,\{X_t\})$0.

The embedded-width $(T,\{X_t\})$1 is the minimum width over all such decompositions. This is equivalent to computing the tree-width of the “facial completion” where all bounded faces are made cliques (Borradaile et al., 2017).

1.2 Embeddable Tree-Width (Spanning Decomposition Trees)

Given a (possibly labeled/directed) graph $(T,\{X_t\})$2, an embeddable tree-decomposition is a quadruple $(T,\{X_t\})$3 where

• $(T,\{X_t\})$4 is a tree whose nodes are partitioned into $(T,\{X_t\})$5 and $(T,\{X_t\})$6 (alternating between vertex and edge nodes),
• $(T,\{X_t\})$7, $(T,\{X_t\})$8 are bijections,
• $(T,\{X_t\})$9 forms a classical tree-decomposition of $\bigcup_{t\in T} X_t = V$0,
• Parent/child associations preserve the local incidence structure.

The embeddable tree-width $\bigcup_{t\in T} X_t = V$1 minimizes $\bigcup_{t\in T} X_t = V$2 among all such decompositions (Chimes et al., 2024).

1.3 Embeddable Tree-Width via Stochastic Embeddings

For $\bigcup_{t\in T} X_t = V$3, the embeddable tree-width of a graph $\bigcup_{t\in T} X_t = V$4 at distortion $\bigcup_{t\in T} X_t = V$5 is the minimum $\bigcup_{t\in T} X_t = V$6 such that there exists a stochastic embedding of $\bigcup_{t\in T} X_t = V$7 into host graphs of tree-width $\bigcup_{t\in T} X_t = V$8 with expected distortion $\bigcup_{t\in T} X_t = V$9 in the metric sense (Chang et al., 2024). This parameter quantifies how well all-pairs distances in $\{u,v\}$0 can be simulcast through bounded-treewidth structures while incurring small additive or multiplicative metric distortion.

2. Structural and Algorithmic Bounds

Explicit relationships between embeddable tree-width and classical tree-width have been established for various graph classes and embedding variants.

2.1 Embedded-Width for Plane Graphs

• Upper bound: If all faces of a plane graph $\{u,v\}$1 have length $\{u,v\}$2, then

$\{u,v\}$3

• k-outerplanar graphs: If $\{u,v\}$4 is $\{u,v\}$5-outerplanar with faces of length $\{u,v\}$6,

$\{u,v\}$7

• Lower bounds: For fixed $\{u,v\}$8, there exist plane graphs with $\{u,v\}$9 but $t$0. For $t$1-outerplanar $t$2, $t$3 (Borradaile et al., 2017).

2.2 Tightness and Extremal Examples

For constant face size $t$4, embedded-width is $t$5. However, with large faces, the gap can become linear in $t$6 or $t$7.

2.3 Stochastic Embeddings of Planar Graphs

• Lower bound: Any stochastic embedding with distortion $t$8 of an $t$9-vertex planar graph into bounded-treewidth hosts requires tree-width at least $u,v\in X_t$0 (Chang et al., 2024).
• Upper bound: Recent results give embeddings with tree-width $u,v\in X_t$1 and expected distortion $u,v\in X_t$2 (Chang et al., 2024).

2.4 Embeddable Tree-Width vs. Classical Tree-Width

Classical tree-decompositions allow arbitrary “bag adjacency,” whereas embeddable decompositions demand a tree “inside” the graph. There exist graph families (e.g., ladder graphs) where $u,v\in X_t$3: for the $u,v\in X_t$4-rung ladder $u,v\in X_t$5, $u,v\in X_t$6 but $u,v\in X_t$7 for all $u,v\in X_t$8 (Chimes et al., 2024).

3. Algorithmic and Complexity Aspects

The study of embeddable tree-width encompasses both theoretical properties and algorithmic tractability, especially within planar or minor-free classes.

3.1 FPT Algorithms for Embedded-Width

For a plane graph $u,v\in X_t$9 and width parameter $v$0, embedded-width can be computed or certified to exceed $v$1 via an FPT algorithm based on recursive decomposition:

• Remove/contract low-degree structures,
• Maximize matchings for graph reduction,
• Recurse on smaller graphs,
• Re-lift structure to $v$2 with detailed path-bag operations,
• Final refinement step with Bodlaender–Kloks routine The overall runtime is $v$3 for computable $v$4 (Borradaile et al., 2017).

3.2 Stochastic Embeddings: Construction and Analysis

The currently tightest construction for planar graphs utilizes a single global $v$5-separating clustering chain and stochastic balanced-cut families, harnessing contraction sequences and shortcut partitions to achieve tree-width $v$6 at distortion $v$7 (Chang et al., 2024).

4. Applications and Significance

Embeddable tree-width, in its multiple forms, underpins key developments in graph algorithms, logical definability, and approximation.

4.1 Logical Characterizations

Embeddable tree-width precisely characterizes those graph languages that are CMSO-definable and generated by tree-verifiable HR grammars. Completeness holds: a language $v$8 is CMSO-definable and of bounded embeddable tree-width iff it is tree-verifiable. This yields decidability for emptiness, membership, and inclusion (Chimes et al., 2024).

4.2 Approximation Algorithms and Metric Embedding

Stochastic and clan embeddings into low-treewidth hosts enable quasi-polynomial time approximation schemes for combinatorial optimization on minor-free graphs, such as metric $v$9-dominating sets and independent sets. Embeddable tree-width quantifies the trade-off between host graph complexity and distortion incurred (Filtser et al., 2021).

4.3 Structure Theorems for Graph Classes

Embeddable and related bag-width parameters appear in structure theorems for planar, bounded-genus, and minor-free graphs, including the existence of optimal-width decompositions with constant-bounded bag tree-width in these classes (Hendrey et al., 27 Nov 2025).

5. Open Problems and Research Directions

Several questions remain unresolved:

• For embedded-width, does there exist a structural gap between $\{t \mid v\in X_t\}$0 and $\{t \mid v\in X_t\}$1 for specific planar embeddings or weakly constrained faces?
• Can the multiplicative constants (e.g., 37 in matching-based FPT algorithms) be further improved (Borradaile et al., 2017)?
• Is it possible to close the remaining $\{t \mid v\in X_t\}$2 factor gap between lower and upper bounds for embeddable tree-width in planar and minor-free graphs, achieving $\{t \mid v\in X_t\}$3 (Chang et al., 2024)?
• Is there a simple characterization of embeddings where $\{t \mid v\in X_t\}$4?
• What is the complexity of computing tree-width for planar graphs under a fixed embedding compared to general planar graphs (Borradaile et al., 2017)?

6. Summary Table of Notions

Parameter Type	Definition Constraint	Relationship to tw(G)
Embedded-width (emw)	Decomposition must contain entire face boundaries in some bag (plane graphs)	emw(G) ≥ tw(G)
Embeddable tree-width (etw)	Decomposition tree is a spanning tree alternating vertices/edges inside $\{t \mid v\in X_t\}$5	$\{t \mid v\in X_t\}$6, sometimes strictly
Stochastic embeddable tw	Embedding to graphs of tw ≤ t with exp. distortion ≤ $\{t \mid v\in X_t\}$7	$\{t \mid v\in X_t\}$8 for planar $\{t \mid v\in X_t\}$9

These parameters collectively refine and extend the classical tree-width invariant, providing new avenues for graph-structural, logical, and algorithmic analysis across planar, minor-free, and algorithmically relevant graph classes (Borradaile et al., 2017, Chimes et al., 2024, Chang et al., 2024, Hendrey et al., 27 Nov 2025).