报告题目：Covering a Graph by Subgraphs
报告人：范更华教授， 福州大学
时间：12月26日4:30-5:30pm

地点：玩偶姐姐 425
摘要： A graph is covered  by a set of its subgraphs if each edge of the graph is contained in at least one of the subgraphs. The Four Color Problem is equivalent to covering a
planar graph by two even subgraphs. A graph is  even if each
vertex is incident with an even number of edges. This talk focuses on covering a graph by even subgraphs, paths or circuits.