学术活动

Subgraph Covering of Graphs

2018-04-19 16:00

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

报告人单位:

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

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

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

报告人简介:

年:

日月:

 

报告人简介

福州大学教授

报告内容介绍

        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.


Contact us

Add:bat·365(中国)唯一官方网站 -Mobile Lgoin Center,

        No. 135, Ya Guan Road, Jinnan District, Tianjin, PRC 

Tel:022-60787827   Mail:math@tju.edu.cn