On The Bar Visibility Number Of Complete Bipartite Graphs
SIAM JOURNAL ON DISCRETE MATHEMATICS(2021)
摘要
A t-bar visibility representation of a graph assigns each vertex up to t horizontal bars in the plane so that two vertices are adjacent if and only if some bar for one vertex can see some bar for the other via an unobstructed vertical channel of positive width. The least t such that G has a t-bar visibility representation is the bar visibility number of G, denoted by b(G). For the complete bipartite graph K-m,K-n, the lower bound b(K-m,K-n) >= inverted right perpendicularmn+4/2m+2ninverted left perpendicular from Euler's formula is well known. We prove that equality holds.
更多查看译文
关键词
bar visibility number, bar visibility graph, planar graph, thickness, complete bipartite graph
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要