当前位置: X-MOL 学术arXiv.cs.DM › 论文详情
Relationship of $k$-Bend and Monotonic $\ell$-Bend Edge Intersection Graphs of Paths on a Grid
arXiv - CS - Discrete Mathematics Pub Date : 2020-02-14 , DOI: arxiv-2002.05998
Eranda Cela; Elisabeth Gaar

If a graph $G$ can be represented by means of paths on a grid, such that each vertex of $G$ corresponds to one path on the grid and two vertices of $G$ are adjacent if and only if the corresponding paths share a grid edge, then this graph is called EPG and the representation is called EPG representation. A $k$-bend EPG representation is an EPG representation in which each path has at most $k$ bends. The class of all graphs that have a $k$-bend EPG representation is denoted by $B_k$. $B_\ell^m$ is the class of all graphs that have a monotonic (each path is ascending in both columns and rows) $\ell$-bend EPG representation. It is known that $B_k^m \subsetneqq B_k$ holds for $k=1$. We prove that $B_k^m \subsetneqq B_k$ holds also for $k \in \{2, 3, 5\}$ and for $k \geqslant 7$ by investigating the $B_k$-membership and $B_k^m$-membership of complete bipartite graphs. In particular we derive necessary conditions for this membership that have to be fulfilled by $m$, $n$ and $k$, where $m$ and $n$ are the number of vertices on the two partition classes of the bipartite graph. We conjecture that $B_{k}^{m} \subsetneqq B_{k}$ holds also for $k\in \{4,6\}$. Furthermore we show that $B_k \not\subseteq B_{2k-9}^m$ holds for all $k\geqslant 5$. This implies that restricting the shape of the paths can lead to a significant increase of the number of bends needed in an EPG representation. So far no bounds on the amount of that increase were known. We prove that $B_1 \subseteq B_3^m$ holds, providing the first result of this kind.
更新日期:2020-02-17

 

全部期刊列表>>
向世界展示您的会议墙报和演示文稿
全球疫情及响应:BMC Medicine专题征稿
欢迎探索2019年最具下载量的化学论文
新版X-MOL期刊搜索和高级搜索功能介绍
化学材料学全球高引用
ACS材料视界
x-mol收录
自然科研论文编辑服务
南方科技大学
南方科技大学
西湖大学
中国科学院长春应化所于聪-4-8
复旦大学
课题组网站
X-MOL
深圳大学二维材料实验室张晗
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug