Abstract Dujmovć, Joret, Micek, Morin, Ueckerdt, and Wood established that every planar
graph is a subgraph of the strong product of a graph with bounded treewidth and a path …

The thinness of a graph is a width parameter that generalizes some properties of interval
graphs, which are exactly the graphs of thinness one. Many NP-complete problems can be …

Let $ box (G) $ be the boxicity of a graph $ G $, $ G [H_1, H_2,\ldots, H_n] $ be the $ G $-
generalized join graph of $ n $-pairwise disjoint graphs $ H_1, H_2,\ldots, H_n $, $ G^ d_k …

The\textit {boxicity}(\textit {cubicity}) of an undirected graph $\Gamma $ is the smallest non-
negative integer $ k $ such that $\Gamma $ can be represented as the intersection graph of …

Word-representable graphs were originally introduced by Kitaev and Pyatkin, motivated by
work of Kitaev and Seif in algebra. Since their introduction, however, there has been a great …

The local boxicity of a graph G, denoted by lbox (G), is the minimum positive integer l such
that G can be obtained using the intersection of k (where k≥ l) interval graphs where each …

A box in Euclidean $ k $-space is the Cartesian product of $ k $ closed intervals on the real
line. The boxicity of a graph $ G $, denoted by $\text {box}(G) $, is the minimum nonnegative …

A box in Euclidean $ k $-space is the Cartesian product $ I_1\times I_2\times\cdots\times I_k
$, where $ I_j $ is a closed interval on the real line. The boxicity of a graph $ G $, denoted by …

In a spatial graph model, vertices are embedded in a metric space, and the link probability
between two vertices depends on this embedding in such a way that vertices that are closer …

The boxicity of a graph $ G $, denoted by $ box (G) $, is the least positive integer $\ell $ such
that $ G $ can be isomorphic to the intersection graph of a family of boxes in Euclidean $\ell …