2-extendable graphs and bricks

 报告题目: 2-extendable graphs and bricks

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




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.