2-extendable graphs and bricks

 报告题目: 2-extendable graphs and bricks

 报  告  人:卢福良    教授(临沂大学)

 报告时间:2017年10月27日(星期五)下午14:00

 报告地点:第三办公区202室


 报告摘要:

A graph G with at least 2n+2 vertices is said to be n-extendable if every matching of size n in G extends to a perfect matching. A brick is a 3-connected and bicritical graph. Let G be 2-extendable with at least six vertices. Then G is either bicritical or elementary bipartite. Here, I present some results and problems about 2-extendable graphs and bricks.


 报告人介绍:

卢福良,现任临沂大学二级教授,临沂大学-韩国水源大学博士生导师,中国运筹学会图论组合学分会青年理事。主持国家自然科学基金3项,在知名学术期刊发表学术论文20余篇。