报告题目：Berge-Fulkerson conjecture for graphs with special eight circuits
时间地点： 2018年12月14日15:00-16:00, 后主楼1129
报告摘要：It is conjectured by Berge and Fulkerson that every bridgeless cubic graph has six perfect matchings such that each edge is contained in exactly two of them. A cubic graph G is Berge-Fulkerson colorable if 2G is 6-edge-colorable. It is an equivalent description of the Berge-Fulkerson conjecture.
In this talk, we will give the following result and its generalizations. Let G be a permutation graph consisting of a 2-factor and a perfect matching . If G contains a circuit D of length 8 with edge sequence , where , and , then G is Berge-Fulkerson colorable.