The local boxicity of a graph G, denoted by lbox(G), is the minimum integer d such that G has a d-local box representation in some dimension. It directly follows from the definition that for any graph G, lbox(G) ≤ box(G).
Dec 8, 2020 · A box is said to be d-local if at most d of the intervals are bounded. In this paper, we investigate the recently introduced local boxicity of a ...
The local boxicity of a graph G , denoted by lbox ( G ) , is the minimum integer d such that G has a d -local box representation in some dimension.
Oct 6, 2018 · The \emph{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 ...
The \emph{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 ...
Dec 1, 2022 · 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 ...
Oct 22, 2024 · A box is said to be d-local if at most d of the intervals are bounded. In this paper, we investigate the recently introduced local boxicity of a ...
The local boxicity of a graph H, denoted by boxℓ(H), is the smallest number k such that H is the intersection of t interval graphs, for some integer t, with ...
Jan 6, 2021 · In this paper, we investigate the recently introduced local boxicity of a graph $G$, which is the minimum $d$ such that $G$ can be represented ...
Moreover, we show that local and union boxicity are also characterized by intersection representations of appropriate axis-aligned boxes in $\mathbb{R}^d$. We ...