当前位置: 首页 > 科学研究 > 学术交流 >
学术交流

Subgraph Covering of Graphs

2018-12-13 09:43    

报告人:范更华 【福州大学】

时   间:2018-04-19 16:00-17:00

地   点:南开大学省身楼216教室


报告人简介

福州大学教授

报告内容介绍

        A graph G is covered by a set X of its subgraphs if each edge of G is contained in
at least one subgraph in X. The famous Four Colour Problem is equivalent to
covering a planar graph by two even subgraphs, which is also equivalent to the
existence of nowher-zero 4-flows in planar graphs. (An even graph is one that
can be covered by a set of edge-disjoint circuits.) This talk will focus on covering
a graph by circuits or paths.

联系我们

地址:天津市海河教育园区雅观路135号32号教学楼,300350
邮箱:maths@tju.edu.cn
电话:+86 (0)22 27402850
传真:+86 (0)22 27402850

Copyright@2017 天津大学数学学院 版权所有

扫码关注学院最新动态