学术报告:Graph Covering and Gallai’s Conjecture

作者: 时间:2021-06-11 点击数:

题目:Graph Covering and Gallai’s Conjecture

报告摘要: 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 graphs by even subgraphs, paths or circuits, with an emphasis on Gallai's Conjecture about covering a connected graph by minimum number of edge-disjoint paths.

主讲人:范更华教授

报告时间:2021.6.1516:00-17:30

报告地点:综合楼810会议室

个人简介:范更华,福州大学教授、博士生导师。国家杰出青年科学基金获得者、中央直接掌握联系的高级专家、享受国务院政府特殊津贴专家、福建省杰出科技人才。曾任中共福州大学委员会常委、副校长,中国数学会组合数学与图论专业委员会主任,全国组合数学与图论学会理事长。

现任福州大学离散数学及其应用教育部重点实验室主任,中国运筹学会副理事长,国际图论界权威刊物《图论杂(Journal of Graph Theory)执行编委(Managing Editor)

主要从事图论领域中的结构图论、极图理论、带权图、欧拉图、整数流理论、子图覆盖等方向的基础理论研究。目前致力于图论在大规模集成电路设计中的应用。由个人独立完成的科研成果哈密顿圈及圈覆盖理论2005年度国家自然科学奖二等奖。

 

   COPYRIGHT@2007-2013   yysx.xmt.edu.cn  厦门理工  beat365官网   版权所有