报告名称:

Weakly Bipancyclic Bipartite Graphs

报告作者：

胡智全

作者简介：

所在学校：

华中师范大学

职称：

教授

其他

博士生导师

报告时间：

2015年5月20日（星期三）14:00-15:00

报告地点：

数统学院201报告厅

报告摘要：

In this talk, it is shown that if G = (V₁; V₂;E) is a bipartite graph such that d(v_i)≥|V_3-i|/3 + 4 for all v_i∈V_i, where i = 1, 2, then G is a weakly bipancyclic graph of girth 4. This improves a theorem of Tian and Zang [7], which asserts that if G is a Hamilton bipartite graph on 2n (n≥60) vertices with minimum degree greater than 2n/5+2, then G is bipancyclic. By combining our result with a theorem of Jackson and Li [6], we obtain that every 2-connected k-regular bipartite graph on at most 6k-38 vertices is bipancyclic.