报告题目：The bar visibility number of graphs
报告人：杨艳副教授,天津大学
报告时间：2019年4月19日,上午10：00-11：30
报告地点：数计学院4号楼229
摘要：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. In this talk, she will present a new upper bound of the bar visibility number of an n-vertex graph which improves the upper bound obtained by Chang et al. (SIAM J. Discrete Math. 18?(2004) 462).?And the bar visibility number of the complete bipartite graph will also been given. This is a joint work with Weiting Cao, Yuanrui Feng and Douglas B. West.
