arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2301.01226math.COcs.DM
收藏

$k$ -$Δ$ -规则毛虫的平面放置和包装

$k$-planar Placement and Packing of $Δ$-regular Caterpillars

Carla Binucci, Emilio Di Giacomo, Michael Kaufmann, Giuseppe Liotta, Alessandra Tappini

摘要:

本文研究了在所谓的超平面环境下的一个\emph{packing}问题,即当宿主图在某种意义下是“几乎平面”的情况.确切地说,我们考虑宿主图是$k$ -平面的情况,即,它允许每个边最多有$k$交叉的嵌入,并且集中在$Δ$ -规则毛虫的家族上,这些毛虫是其非叶顶点具有相同程度$Δ$的毛虫。我们研究的依赖性$k$从包装的毛虫的数量$h$,在这种情况下,这些毛虫都是同构的(在这种情况下,包装被称为\emph{placement}),当他们不是。我们给出了放置$h$ $Δ$ -经常毛毛虫和充分条件包装的一组$Δ_1$ -,$Δ_2$ -,$\dots$,$Δ_h$ -经常毛毛虫,使程度$Δ_i$和程度$Δ_j$的非叶顶点可以不同从一个毛毛虫到另一个,为$1 \leq i,j \leq h$,$i\neq j$。

英文摘要:

This paper studies a \emph{packing} problem in the so-called beyond-planar setting, that is when the host graph is ``almost-planar'' in some sense. Precisely, we consider the case that the host graph is $k$-planar, i.e., it admits an embedding with at most $k$ crossings per edge, and focus on families of $Δ$-regular caterpillars, that are caterpillars whose non-leaf vertices have the same degree $Δ$. We study the dependency of $k$ from the number $h$ of caterpillars that are packed, both in the case that these caterpillars are all isomorphic to one another (in which case the packing is called \emph{placement}) and when they are not. We give necessary and sufficient conditions for the placement of $h$ $Δ$-regular caterpillars and sufficient conditions for the packing of a set of $Δ_1$-, $Δ_2$-, $\dots$, $Δ_h$-regular caterpillars such that the degree $Δ_i$ and the degree $Δ_j$ of the non-leaf vertices can differ from one caterpillar to another, for $1 \leq i,j \leq h$, $i\neq j$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑