报告题目：path cover of regular graphs

报告人：喻革新教授 威廉玛丽学院

报告时间：7月19日 下午3:00-4:00

报告地点：五教5101

摘要:  

A path cover of a graph is a set of disjoint paths so that every vertex in the graph is contained in one of the paths. The path cover number p(G) of graph G is the cardinality of a path cover with the minimum number of paths. Clearly p(G) is at most the number of vertices in G.  On the other hand, p(G) could be close to its number of vertices even if G is connected. Thus we will focus on path covers of regular graphs.   In this talk, we will discuss problems and recent progress on path cover numbers of regular graphs.