Berge-Fulkerson conjecture for graphs with special eight circuits
代数
报告题目(Title)：Berge-Fulkerson conjecture for graphs with special eight circuits
报告人(Speaker)：郝荣霞教授（北京交通大学）
地点(Place)：后主楼1129
时间(Time)：2018年12月14日15:00-16:00
邀请人(Inviter)：徐敏
报告摘要
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.
